/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:38:39,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:38:39,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:38:39,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:38:39,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:38:39,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:38:39,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:38:39,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:38:39,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:38:39,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:38:39,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:38:39,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:38:39,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:38:39,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:38:39,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:38:39,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:38:39,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:38:39,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:38:39,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:38:39,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:38:39,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:38:39,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:38:39,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:38:39,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:38:39,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:38:39,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:38:39,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:38:39,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:38:39,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:38:39,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:38:39,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:38:39,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:38:39,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:38:39,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:38:39,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:38:39,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:38:39,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:38:39,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:38:39,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:38:39,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:38:39,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:38:39,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 02:38:39,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:38:39,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:38:39,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:38:39,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:38:39,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:38:39,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:38:39,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:38:39,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:38:39,844 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:38:39,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:38:39,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:38:39,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:38:39,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:38:39,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:38:39,847 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:38:40,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:38:40,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:38:40,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:38:40,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:38:40,090 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:38:40,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2022-01-10 02:38:40,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccefd61a/1d3d5a62cfa740e1afea567eac050a29/FLAGb0bf74fb6 [2022-01-10 02:38:40,594 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:38:40,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2022-01-10 02:38:40,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccefd61a/1d3d5a62cfa740e1afea567eac050a29/FLAGb0bf74fb6 [2022-01-10 02:38:40,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccefd61a/1d3d5a62cfa740e1afea567eac050a29 [2022-01-10 02:38:40,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:38:40,616 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:38:40,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:38:40,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:38:40,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:38:40,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:40,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c04a487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40, skipping insertion in model container [2022-01-10 02:38:40,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:40,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:38:40,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:38:40,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2022-01-10 02:38:40,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:38:40,924 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:38:40,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2022-01-10 02:38:40,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:38:40,986 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:38:40,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40 WrapperNode [2022-01-10 02:38:40,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:38:40,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:38:40,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:38:40,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:38:40,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,033 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2022-01-10 02:38:41,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:38:41,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:38:41,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:38:41,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:38:41,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:38:41,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:38:41,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:38:41,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:38:41,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (1/1) ... [2022-01-10 02:38:41,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:38:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:38:41,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:38:41,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:38:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:38:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:38:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:38:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:38:41,219 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:38:41,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:38:41,505 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:38:41,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:38:41,510 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 02:38:41,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:41 BoogieIcfgContainer [2022-01-10 02:38:41,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:38:41,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:38:41,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:38:41,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:38:41,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:38:40" (1/3) ... [2022-01-10 02:38:41,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8c7c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:41, skipping insertion in model container [2022-01-10 02:38:41,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:40" (2/3) ... [2022-01-10 02:38:41,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8c7c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:41, skipping insertion in model container [2022-01-10 02:38:41,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:41" (3/3) ... [2022-01-10 02:38:41,525 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2022-01-10 02:38:41,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:38:41,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:38:41,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:38:41,575 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:38:41,575 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:38:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 02:38:41,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:41,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:41,594 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2022-01-10 02:38:41,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:41,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903429019] [2022-01-10 02:38:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:41,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:41,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:41,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 02:38:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:41,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 02:38:41,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:41,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:41,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:41,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903429019] [2022-01-10 02:38:41,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903429019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:41,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:41,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 02:38:41,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225481301] [2022-01-10 02:38:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:41,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 02:38:41,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 02:38:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 02:38:41,792 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:41,812 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2022-01-10 02:38:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 02:38:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 02:38:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:41,821 INFO L225 Difference]: With dead ends: 57 [2022-01-10 02:38:41,821 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 02:38:41,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 02:38:41,828 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:41,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:38:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 02:38:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-10 02:38:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2022-01-10 02:38:41,865 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2022-01-10 02:38:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:41,866 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2022-01-10 02:38:41,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2022-01-10 02:38:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 02:38:41,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:41,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:41,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:42,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:42,080 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2022-01-10 02:38:42,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917984920] [2022-01-10 02:38:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:42,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:42,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:42,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 02:38:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:42,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:42,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:42,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:42,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:42,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917984920] [2022-01-10 02:38:42,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917984920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:42,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:42,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:42,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974117582] [2022-01-10 02:38:42,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:42,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:42,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:42,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:42,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:42,235 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:42,426 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2022-01-10 02:38:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 02:38:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:42,428 INFO L225 Difference]: With dead ends: 116 [2022-01-10 02:38:42,428 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 02:38:42,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:42,429 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:42,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:38:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 02:38:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-01-10 02:38:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2022-01-10 02:38:42,443 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2022-01-10 02:38:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:42,444 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2022-01-10 02:38:42,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2022-01-10 02:38:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 02:38:42,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:42,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:42,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:42,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:42,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2022-01-10 02:38:42,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004628721] [2022-01-10 02:38:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:42,655 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:42,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:42,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:42,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 02:38:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:42,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:42,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:42,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:42,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004628721] [2022-01-10 02:38:42,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004628721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:42,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:42,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:38:42,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450127289] [2022-01-10 02:38:42,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:42,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:38:42,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:38:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:42,779 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:42,890 INFO L93 Difference]: Finished difference Result 164 states and 271 transitions. [2022-01-10 02:38:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:38:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 02:38:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:42,892 INFO L225 Difference]: With dead ends: 164 [2022-01-10 02:38:42,892 INFO L226 Difference]: Without dead ends: 136 [2022-01-10 02:38:42,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:42,893 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:42,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 284 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:38:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-10 02:38:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2022-01-10 02:38:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2022-01-10 02:38:42,903 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 13 [2022-01-10 02:38:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:42,903 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2022-01-10 02:38:42,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2022-01-10 02:38:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 02:38:42,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:42,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:42,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 02:38:43,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:43,112 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2022-01-10 02:38:43,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110795590] [2022-01-10 02:38:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:43,114 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:43,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:43,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 02:38:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:43,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:38:43,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:43,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:43,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:43,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110795590] [2022-01-10 02:38:43,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110795590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:43,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:43,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:38:43,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822549826] [2022-01-10 02:38:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:43,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:38:43,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:43,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:38:43,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:38:43,220 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:43,479 INFO L93 Difference]: Finished difference Result 212 states and 341 transitions. [2022-01-10 02:38:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:38:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 02:38:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:43,484 INFO L225 Difference]: With dead ends: 212 [2022-01-10 02:38:43,484 INFO L226 Difference]: Without dead ends: 184 [2022-01-10 02:38:43,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:38:43,486 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 166 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:43,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 559 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:38:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-01-10 02:38:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 81. [2022-01-10 02:38:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2022-01-10 02:38:43,503 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 14 [2022-01-10 02:38:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:43,503 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2022-01-10 02:38:43,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2022-01-10 02:38:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 02:38:43,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:43,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:43,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:43,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:43,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2022-01-10 02:38:43,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:43,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978797202] [2022-01-10 02:38:43,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:43,717 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:43,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 02:38:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:43,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:38:43,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:43,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:43,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978797202] [2022-01-10 02:38:43,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978797202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:43,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:43,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:38:43,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743269812] [2022-01-10 02:38:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:43,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:38:43,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:38:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:38:43,809 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:43,956 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2022-01-10 02:38:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:38:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 02:38:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:43,957 INFO L225 Difference]: With dead ends: 227 [2022-01-10 02:38:43,957 INFO L226 Difference]: Without dead ends: 199 [2022-01-10 02:38:43,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:38:43,960 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:43,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 683 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:38:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-01-10 02:38:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 87. [2022-01-10 02:38:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.5) internal successors, (129), 86 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2022-01-10 02:38:43,977 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 14 [2022-01-10 02:38:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:43,977 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2022-01-10 02:38:43,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2022-01-10 02:38:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 02:38:43,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:43,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:43,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:44,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:44,179 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2022-01-10 02:38:44,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:44,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299233564] [2022-01-10 02:38:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:44,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:44,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:44,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 02:38:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:44,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:44,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:44,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:44,284 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:44,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299233564] [2022-01-10 02:38:44,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299233564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:44,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:44,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:44,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757695176] [2022-01-10 02:38:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:44,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:44,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:44,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:44,288 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:44,427 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2022-01-10 02:38:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 02:38:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:44,428 INFO L225 Difference]: With dead ends: 243 [2022-01-10 02:38:44,429 INFO L226 Difference]: Without dead ends: 173 [2022-01-10 02:38:44,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:44,430 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:44,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:38:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-10 02:38:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2022-01-10 02:38:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 96 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2022-01-10 02:38:44,436 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 25 [2022-01-10 02:38:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:44,437 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2022-01-10 02:38:44,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2022-01-10 02:38:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 02:38:44,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:44,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:44,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:44,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:44,647 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2022-01-10 02:38:44,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:44,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95140609] [2022-01-10 02:38:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:44,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:44,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:44,649 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:44,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 02:38:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:44,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:44,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:44,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:44,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:44,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95140609] [2022-01-10 02:38:44,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95140609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:44,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:44,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:38:44,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767013865] [2022-01-10 02:38:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:44,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:38:44,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:44,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:38:44,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:44,767 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:44,916 INFO L93 Difference]: Finished difference Result 325 states and 477 transitions. [2022-01-10 02:38:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:38:44,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 02:38:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:44,918 INFO L225 Difference]: With dead ends: 325 [2022-01-10 02:38:44,918 INFO L226 Difference]: Without dead ends: 255 [2022-01-10 02:38:44,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:44,919 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 127 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:44,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 342 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:38:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-10 02:38:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 97. [2022-01-10 02:38:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 96 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2022-01-10 02:38:44,926 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 26 [2022-01-10 02:38:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:44,926 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2022-01-10 02:38:44,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2022-01-10 02:38:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 02:38:44,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:44,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:44,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:45,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:45,136 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1985045161, now seen corresponding path program 1 times [2022-01-10 02:38:45,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:45,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512770158] [2022-01-10 02:38:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:45,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:45,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:45,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 02:38:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:45,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:38:45,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:45,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:45,258 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512770158] [2022-01-10 02:38:45,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512770158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:45,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:45,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:38:45,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901495783] [2022-01-10 02:38:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:45,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:38:45,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:38:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:38:45,260 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:45,661 INFO L93 Difference]: Finished difference Result 433 states and 630 transitions. [2022-01-10 02:38:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:38:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 02:38:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:45,664 INFO L225 Difference]: With dead ends: 433 [2022-01-10 02:38:45,664 INFO L226 Difference]: Without dead ends: 353 [2022-01-10 02:38:45,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:38:45,665 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 377 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:45,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 562 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:38:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-01-10 02:38:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 89. [2022-01-10 02:38:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2022-01-10 02:38:45,672 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 27 [2022-01-10 02:38:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:45,672 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2022-01-10 02:38:45,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2022-01-10 02:38:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 02:38:45,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:45,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:45,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:45,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:45,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2022-01-10 02:38:45,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:45,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337607713] [2022-01-10 02:38:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:45,876 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:45,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 02:38:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:45,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:45,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:46,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:46,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337607713] [2022-01-10 02:38:46,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337607713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:46,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:46,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:38:46,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152111000] [2022-01-10 02:38:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:46,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:38:46,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:38:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:46,018 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:46,108 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-01-10 02:38:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:38:46,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 02:38:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:46,109 INFO L225 Difference]: With dead ends: 158 [2022-01-10 02:38:46,109 INFO L226 Difference]: Without dead ends: 142 [2022-01-10 02:38:46,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:46,110 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:46,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 144 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2022-01-10 02:38:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-10 02:38:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2022-01-10 02:38:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2022-01-10 02:38:46,117 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 29 [2022-01-10 02:38:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:46,117 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2022-01-10 02:38:46,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2022-01-10 02:38:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 02:38:46,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:46,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:46,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:46,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:46,326 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1570096335, now seen corresponding path program 1 times [2022-01-10 02:38:46,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:46,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003714879] [2022-01-10 02:38:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:46,327 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:46,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:46,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:46,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 02:38:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:46,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:38:46,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:46,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:46,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003714879] [2022-01-10 02:38:46,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003714879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:46,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:46,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:38:46,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837538227] [2022-01-10 02:38:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:46,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:38:46,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:38:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:38:46,463 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:46,613 INFO L93 Difference]: Finished difference Result 210 states and 293 transitions. [2022-01-10 02:38:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:38:46,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 02:38:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:46,615 INFO L225 Difference]: With dead ends: 210 [2022-01-10 02:38:46,615 INFO L226 Difference]: Without dead ends: 194 [2022-01-10 02:38:46,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:38:46,616 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:46,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 281 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2022-01-10 02:38:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-01-10 02:38:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 125. [2022-01-10 02:38:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2022-01-10 02:38:46,623 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 30 [2022-01-10 02:38:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:46,623 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2022-01-10 02:38:46,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2022-01-10 02:38:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 02:38:46,624 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:46,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:46,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:46,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:46,832 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1760226409, now seen corresponding path program 1 times [2022-01-10 02:38:46,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437802094] [2022-01-10 02:38:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:46,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:46,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:46,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:38:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:46,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:38:46,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:47,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:47,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:47,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437802094] [2022-01-10 02:38:47,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437802094] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:47,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:47,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 02:38:47,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856157214] [2022-01-10 02:38:47,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:47,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 02:38:47,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 02:38:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:38:47,134 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:47,738 INFO L93 Difference]: Finished difference Result 375 states and 560 transitions. [2022-01-10 02:38:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:38:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 02:38:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:47,740 INFO L225 Difference]: With dead ends: 375 [2022-01-10 02:38:47,740 INFO L226 Difference]: Without dead ends: 297 [2022-01-10 02:38:47,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:38:47,741 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 671 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:47,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 433 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:38:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-10 02:38:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 265. [2022-01-10 02:38:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.428030303030303) internal successors, (377), 264 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 377 transitions. [2022-01-10 02:38:47,754 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 377 transitions. Word has length 31 [2022-01-10 02:38:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:47,754 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 377 transitions. [2022-01-10 02:38:47,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 377 transitions. [2022-01-10 02:38:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 02:38:47,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:47,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:47,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:47,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:47,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1900775019, now seen corresponding path program 1 times [2022-01-10 02:38:47,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:47,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210659738] [2022-01-10 02:38:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:47,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:47,968 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:47,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:38:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:47,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:48,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:48,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:48,179 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:48,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210659738] [2022-01-10 02:38:48,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210659738] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:48,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:48,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:38:48,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951939695] [2022-01-10 02:38:48,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:48,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:38:48,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:38:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:38:48,181 INFO L87 Difference]: Start difference. First operand 265 states and 377 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:48,587 INFO L93 Difference]: Finished difference Result 1333 states and 1932 transitions. [2022-01-10 02:38:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:38:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 02:38:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:48,592 INFO L225 Difference]: With dead ends: 1333 [2022-01-10 02:38:48,592 INFO L226 Difference]: Without dead ends: 1093 [2022-01-10 02:38:48,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:38:48,593 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 359 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:48,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 217 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:38:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-01-10 02:38:48,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 832. [2022-01-10 02:38:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.388688327316486) internal successors, (1154), 831 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1154 transitions. [2022-01-10 02:38:48,625 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1154 transitions. Word has length 31 [2022-01-10 02:38:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:48,625 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1154 transitions. [2022-01-10 02:38:48,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1154 transitions. [2022-01-10 02:38:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 02:38:48,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:48,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:48,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:48,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:48,838 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:48,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1981630602, now seen corresponding path program 1 times [2022-01-10 02:38:48,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058886575] [2022-01-10 02:38:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:48,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:48,840 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:48,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 02:38:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:48,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:38:48,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:48,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:48,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:48,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058886575] [2022-01-10 02:38:48,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058886575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:48,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:48,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:38:48,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522175664] [2022-01-10 02:38:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:48,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:38:48,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:38:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:38:48,935 INFO L87 Difference]: Start difference. First operand 832 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:48,979 INFO L93 Difference]: Finished difference Result 1216 states and 1675 transitions. [2022-01-10 02:38:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:38:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 02:38:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:48,984 INFO L225 Difference]: With dead ends: 1216 [2022-01-10 02:38:48,984 INFO L226 Difference]: Without dead ends: 1102 [2022-01-10 02:38:48,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:38:48,985 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:48,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:38:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-01-10 02:38:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 948. [2022-01-10 02:38:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 1.4023231256599789) internal successors, (1328), 947 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1328 transitions. [2022-01-10 02:38:49,025 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1328 transitions. Word has length 33 [2022-01-10 02:38:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:49,026 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1328 transitions. [2022-01-10 02:38:49,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1328 transitions. [2022-01-10 02:38:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 02:38:49,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:49,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:49,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:49,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:49,236 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2055171256, now seen corresponding path program 1 times [2022-01-10 02:38:49,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132006585] [2022-01-10 02:38:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:49,237 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:49,238 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 02:38:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:49,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:49,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:49,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:49,337 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:49,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132006585] [2022-01-10 02:38:49,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132006585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:49,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:49,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:49,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844457755] [2022-01-10 02:38:49,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:49,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:49,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:49,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:49,339 INFO L87 Difference]: Start difference. First operand 948 states and 1328 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:49,403 INFO L93 Difference]: Finished difference Result 971 states and 1352 transitions. [2022-01-10 02:38:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 02:38:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:49,407 INFO L225 Difference]: With dead ends: 971 [2022-01-10 02:38:49,407 INFO L226 Difference]: Without dead ends: 966 [2022-01-10 02:38:49,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:49,408 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:49,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 86 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-01-10 02:38:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-10 02:38:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 951. [2022-01-10 02:38:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 1.4021052631578947) internal successors, (1332), 950 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1332 transitions. [2022-01-10 02:38:49,439 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1332 transitions. Word has length 33 [2022-01-10 02:38:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:49,439 INFO L470 AbstractCegarLoop]: Abstraction has 951 states and 1332 transitions. [2022-01-10 02:38:49,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1332 transitions. [2022-01-10 02:38:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 02:38:49,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:49,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:49,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:49,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:49,649 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1693819129, now seen corresponding path program 1 times [2022-01-10 02:38:49,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:49,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177560605] [2022-01-10 02:38:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:49,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:49,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:49,651 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:49,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 02:38:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:49,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:49,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:49,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:49,783 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:49,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177560605] [2022-01-10 02:38:49,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177560605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:49,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:49,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:49,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430293910] [2022-01-10 02:38:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:49,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:49,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:49,786 INFO L87 Difference]: Start difference. First operand 951 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:49,848 INFO L93 Difference]: Finished difference Result 978 states and 1365 transitions. [2022-01-10 02:38:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 02:38:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:49,853 INFO L225 Difference]: With dead ends: 978 [2022-01-10 02:38:49,854 INFO L226 Difference]: Without dead ends: 964 [2022-01-10 02:38:49,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:49,856 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:49,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2022-01-10 02:38:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-01-10 02:38:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 954. [2022-01-10 02:38:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 1.4018887722980062) internal successors, (1336), 953 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1336 transitions. [2022-01-10 02:38:49,888 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1336 transitions. Word has length 39 [2022-01-10 02:38:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:49,890 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1336 transitions. [2022-01-10 02:38:49,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1336 transitions. [2022-01-10 02:38:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 02:38:49,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:49,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:49,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:50,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:50,100 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash 884472503, now seen corresponding path program 1 times [2022-01-10 02:38:50,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:50,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280039304] [2022-01-10 02:38:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:50,101 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:50,102 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:50,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 02:38:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:50,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:50,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:50,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:50,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280039304] [2022-01-10 02:38:50,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280039304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:50,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:50,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:50,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126110645] [2022-01-10 02:38:50,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:50,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:50,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:50,241 INFO L87 Difference]: Start difference. First operand 954 states and 1336 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:50,312 INFO L93 Difference]: Finished difference Result 979 states and 1366 transitions. [2022-01-10 02:38:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 02:38:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:50,316 INFO L225 Difference]: With dead ends: 979 [2022-01-10 02:38:50,316 INFO L226 Difference]: Without dead ends: 965 [2022-01-10 02:38:50,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:50,316 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:50,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-01-10 02:38:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-01-10 02:38:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 953. [2022-01-10 02:38:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.4023109243697478) internal successors, (1335), 952 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1335 transitions. [2022-01-10 02:38:50,345 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1335 transitions. Word has length 39 [2022-01-10 02:38:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:50,345 INFO L470 AbstractCegarLoop]: Abstraction has 953 states and 1335 transitions. [2022-01-10 02:38:50,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1335 transitions. [2022-01-10 02:38:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 02:38:50,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:50,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:50,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:50,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:50,555 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1635487431, now seen corresponding path program 1 times [2022-01-10 02:38:50,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:50,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194330174] [2022-01-10 02:38:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:50,556 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:50,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:50,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:50,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 02:38:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:50,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:50,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:50,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:50,786 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:50,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194330174] [2022-01-10 02:38:50,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194330174] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:50,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:50,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:38:50,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115473412] [2022-01-10 02:38:50,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:50,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:38:50,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:38:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:38:50,788 INFO L87 Difference]: Start difference. First operand 953 states and 1335 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:50,994 INFO L93 Difference]: Finished difference Result 1899 states and 2666 transitions. [2022-01-10 02:38:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:38:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 02:38:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:50,999 INFO L225 Difference]: With dead ends: 1899 [2022-01-10 02:38:50,999 INFO L226 Difference]: Without dead ends: 1332 [2022-01-10 02:38:51,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:38:51,000 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 122 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:51,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 117 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 159 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-01-10 02:38:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-01-10 02:38:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1058. [2022-01-10 02:38:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 1.3964049195837276) internal successors, (1476), 1057 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1476 transitions. [2022-01-10 02:38:51,039 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1476 transitions. Word has length 39 [2022-01-10 02:38:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:51,039 INFO L470 AbstractCegarLoop]: Abstraction has 1058 states and 1476 transitions. [2022-01-10 02:38:51,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1476 transitions. [2022-01-10 02:38:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 02:38:51,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:51,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:38:51,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:51,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:51,250 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1564530873, now seen corresponding path program 1 times [2022-01-10 02:38:51,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:51,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556200731] [2022-01-10 02:38:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:51,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:51,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:51,252 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:51,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 02:38:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:51,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:51,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:51,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:38:51,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556200731] [2022-01-10 02:38:51,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556200731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:38:51,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:38:51,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:38:51,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688922082] [2022-01-10 02:38:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:38:51,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:38:51,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:38:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:51,384 INFO L87 Difference]: Start difference. First operand 1058 states and 1476 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:51,456 INFO L93 Difference]: Finished difference Result 1093 states and 1515 transitions. [2022-01-10 02:38:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-01-10 02:38:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:51,459 INFO L225 Difference]: With dead ends: 1093 [2022-01-10 02:38:51,460 INFO L226 Difference]: Without dead ends: 1077 [2022-01-10 02:38:51,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:38:51,460 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:51,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 62 Unchecked, 0.0s Time] [2022-01-10 02:38:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-01-10 02:38:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1058. [2022-01-10 02:38:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 1.3954588457899717) internal successors, (1475), 1057 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1475 transitions. [2022-01-10 02:38:51,494 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1475 transitions. Word has length 39 [2022-01-10 02:38:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:51,494 INFO L470 AbstractCegarLoop]: Abstraction has 1058 states and 1475 transitions. [2022-01-10 02:38:51,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1475 transitions. [2022-01-10 02:38:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 02:38:51,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:51,496 INFO L514 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] [2022-01-10 02:38:51,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:51,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:51,704 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:51,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash 775978409, now seen corresponding path program 1 times [2022-01-10 02:38:51,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:51,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498717592] [2022-01-10 02:38:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:51,705 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:51,707 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:51,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 02:38:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:51,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:38:51,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:51,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:51,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:51,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498717592] [2022-01-10 02:38:51,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498717592] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:51,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:51,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 02:38:51,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841591542] [2022-01-10 02:38:51,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:51,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:38:51,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:38:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:38:51,994 INFO L87 Difference]: Start difference. First operand 1058 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:52,215 INFO L93 Difference]: Finished difference Result 2292 states and 3217 transitions. [2022-01-10 02:38:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:38:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 02:38:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:52,220 INFO L225 Difference]: With dead ends: 2292 [2022-01-10 02:38:52,220 INFO L226 Difference]: Without dead ends: 1556 [2022-01-10 02:38:52,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:38:52,222 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 106 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:52,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 140 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 188 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2022-01-10 02:38:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-01-10 02:38:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1186. [2022-01-10 02:38:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4033755274261603) internal successors, (1663), 1185 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1663 transitions. [2022-01-10 02:38:52,270 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1663 transitions. Word has length 42 [2022-01-10 02:38:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:52,270 INFO L470 AbstractCegarLoop]: Abstraction has 1186 states and 1663 transitions. [2022-01-10 02:38:52,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1663 transitions. [2022-01-10 02:38:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 02:38:52,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:52,272 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:38:52,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:52,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:52,480 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 382951399, now seen corresponding path program 1 times [2022-01-10 02:38:52,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037859801] [2022-01-10 02:38:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:52,481 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:52,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:52,482 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:52,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 02:38:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:52,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:38:52,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:52,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:38:52,663 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037859801] [2022-01-10 02:38:52,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037859801] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:52,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:52,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2022-01-10 02:38:52,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902386504] [2022-01-10 02:38:52,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:52,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:38:52,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:38:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:52,664 INFO L87 Difference]: Start difference. First operand 1186 states and 1663 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:38:52,773 INFO L93 Difference]: Finished difference Result 1788 states and 2500 transitions. [2022-01-10 02:38:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:38:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 02:38:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:38:52,778 INFO L225 Difference]: With dead ends: 1788 [2022-01-10 02:38:52,778 INFO L226 Difference]: Without dead ends: 1274 [2022-01-10 02:38:52,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:38:52,780 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:38:52,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 74 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:38:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-01-10 02:38:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1182. [2022-01-10 02:38:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.3920406435224386) internal successors, (1644), 1181 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1644 transitions. [2022-01-10 02:38:52,853 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1644 transitions. Word has length 42 [2022-01-10 02:38:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:38:52,853 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 1644 transitions. [2022-01-10 02:38:52,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:38:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1644 transitions. [2022-01-10 02:38:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 02:38:52,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:38:52,855 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 02:38:52,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 02:38:53,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:38:53,055 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:38:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:38:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2022-01-10 02:38:53,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:38:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944204212] [2022-01-10 02:38:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:38:53,057 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:38:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:38:53,058 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:38:53,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 02:38:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:38:53,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 02:38:53,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:38:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:38:55,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:38:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:38:56,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:38:56,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944204212] [2022-01-10 02:38:56,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944204212] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:38:56,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:38:56,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-01-10 02:38:56,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764081922] [2022-01-10 02:38:56,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:38:56,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-10 02:38:56,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:38:56,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-10 02:38:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 02:38:56,624 INFO L87 Difference]: Start difference. First operand 1182 states and 1644 transitions. Second operand has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:02,476 INFO L93 Difference]: Finished difference Result 3662 states and 4993 transitions. [2022-01-10 02:39:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-10 02:39:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 02:39:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:02,487 INFO L225 Difference]: With dead ends: 3662 [2022-01-10 02:39:02,487 INFO L226 Difference]: Without dead ends: 3456 [2022-01-10 02:39:02,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1360, Invalid=4190, Unknown=0, NotChecked=0, Total=5550 [2022-01-10 02:39:02,490 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 2224 mSDsluCounter, 5095 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 5466 SdHoareTripleChecker+Invalid, 2295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:02,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2224 Valid, 5466 Invalid, 2295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2058 Invalid, 0 Unknown, 139 Unchecked, 2.2s Time] [2022-01-10 02:39:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2022-01-10 02:39:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 1778. [2022-01-10 02:39:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1777 states have (on average 1.365785030951041) internal successors, (2427), 1777 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2427 transitions. [2022-01-10 02:39:02,606 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2427 transitions. Word has length 51 [2022-01-10 02:39:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:02,606 INFO L470 AbstractCegarLoop]: Abstraction has 1778 states and 2427 transitions. [2022-01-10 02:39:02,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2427 transitions. [2022-01-10 02:39:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 02:39:02,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:02,608 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 02:39:02,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 02:39:02,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:39:02,817 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 592562209, now seen corresponding path program 1 times [2022-01-10 02:39:02,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950654158] [2022-01-10 02:39:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:02,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:02,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:02,819 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:39:02,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 02:39:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:39:02,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:39:02,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:39:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 02:39:02,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:39:02,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:39:02,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950654158] [2022-01-10 02:39:02,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950654158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:39:02,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:39:02,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:39:02,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528601516] [2022-01-10 02:39:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:39:02,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:39:02,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:39:02,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:39:02,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:39:02,955 INFO L87 Difference]: Start difference. First operand 1778 states and 2427 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:39:03,165 INFO L93 Difference]: Finished difference Result 2326 states and 3159 transitions. [2022-01-10 02:39:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:39:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 02:39:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:39:03,173 INFO L225 Difference]: With dead ends: 2326 [2022-01-10 02:39:03,173 INFO L226 Difference]: Without dead ends: 2298 [2022-01-10 02:39:03,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:39:03,174 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 130 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:39:03,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 449 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2022-01-10 02:39:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2022-01-10 02:39:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1787. [2022-01-10 02:39:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1786 states have (on average 1.364501679731243) internal successors, (2437), 1786 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2437 transitions. [2022-01-10 02:39:03,278 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2437 transitions. Word has length 51 [2022-01-10 02:39:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:39:03,278 INFO L470 AbstractCegarLoop]: Abstraction has 1787 states and 2437 transitions. [2022-01-10 02:39:03,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:39:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2437 transitions. [2022-01-10 02:39:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-10 02:39:03,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:39:03,280 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:39:03,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 02:39:03,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:39:03,489 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:39:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:39:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2022-01-10 02:39:03,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:39:03,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280053575] [2022-01-10 02:39:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:39:03,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:39:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:39:03,491 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:39:03,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 02:39:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 02:39:03,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 02:39:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 02:39:03,583 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 02:39:03,583 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 02:39:03,584 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:39:03,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 02:39:03,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:39:03,797 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:39:03,799 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:39:03,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:03 BoogieIcfgContainer [2022-01-10 02:39:03,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:39:03,862 INFO L158 Benchmark]: Toolchain (without parser) took 23245.81ms. Allocated memory was 183.5MB in the beginning and 282.1MB in the end (delta: 98.6MB). Free memory was 126.0MB in the beginning and 206.0MB in the end (delta: -80.0MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,862 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:39:03,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.98ms. Allocated memory was 183.5MB in the beginning and 234.9MB in the end (delta: 51.4MB). Free memory was 125.8MB in the beginning and 205.2MB in the end (delta: -79.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 234.9MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,863 INFO L158 Benchmark]: Boogie Preprocessor took 36.46ms. Allocated memory is still 234.9MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,863 INFO L158 Benchmark]: RCFGBuilder took 440.29ms. Allocated memory is still 234.9MB. Free memory was 201.5MB in the beginning and 186.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,863 INFO L158 Benchmark]: TraceAbstraction took 22348.22ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 186.3MB in the beginning and 206.0MB in the end (delta: -19.7MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2022-01-10 02:39:03,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.98ms. Allocated memory was 183.5MB in the beginning and 234.9MB in the end (delta: 51.4MB). Free memory was 125.8MB in the beginning and 205.2MB in the end (delta: -79.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 234.9MB. Free memory was 205.2MB in the beginning and 203.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.46ms. Allocated memory is still 234.9MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.29ms. Allocated memory is still 234.9MB. Free memory was 201.5MB in the beginning and 186.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 22348.22ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 186.3MB in the beginning and 206.0MB in the end (delta: -19.7MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=0, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=255, \old(b)=0, \result=511, a=255, a0=-1, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=1, r=511, r0=-1, r1=1, r2=0, r3=0] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5050 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5050 mSDsluCounter, 10587 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 945 IncrementalHoareTripleChecker+Unchecked, 8469 mSDsCounter, 565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6179 IncrementalHoareTripleChecker+Invalid, 7689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 565 mSolverCounterUnsat, 2118 mSDtfsCounter, 6179 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 771 SyntacticMatches, 3 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1787occurred in iteration=22, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 4289 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 726 NumberOfCodeBlocks, 726 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 880 ConstructedInterpolants, 46 QuantifiedInterpolants, 6748 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1503 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 92/131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 02:39:03,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...