/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/s3_srvr_1a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:40:06,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:40:06,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:40:06,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:40:06,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:40:06,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:40:06,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:40:06,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:40:06,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:40:06,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:40:06,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:40:06,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:40:06,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:40:06,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:40:06,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:40:06,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:40:06,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:40:06,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:40:06,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:40:06,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:40:06,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:40:06,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:40:06,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:40:06,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:40:06,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:40:06,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:40:06,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:40:06,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:40:06,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:40:06,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:40:06,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:40:06,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:40:06,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:40:06,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:40:06,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:40:06,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:40:06,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:40:06,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:40:06,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:40:06,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:40:06,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:40:06,253 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:40:06,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:40:06,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:40:06,274 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:40:06,274 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:40:06,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:40:06,275 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:40:06,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:40:06,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:40:06,275 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:40:06,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:40:06,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:40:06,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:40:06,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:06,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:06,277 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:40:06,278 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:40:06,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:40:06,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:40:06,278 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:40:06,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:40:06,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:40:06,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:40:06,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:40:06,504 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:40:06,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 02:40:06,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5357a44/4679988480ff4e9895b3de4f1b507989/FLAGb39ca3ff3 [2022-01-10 02:40:06,956 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:40:06,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1a.BV.c.cil.c [2022-01-10 02:40:06,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5357a44/4679988480ff4e9895b3de4f1b507989/FLAGb39ca3ff3 [2022-01-10 02:40:06,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5357a44/4679988480ff4e9895b3de4f1b507989 [2022-01-10 02:40:06,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:40:06,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:40:06,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:06,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:40:06,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:40:06,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:06" (1/1) ... [2022-01-10 02:40:06,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d587c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:06, skipping insertion in model container [2022-01-10 02:40:06,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:06" (1/1) ... [2022-01-10 02:40:07,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:40:07,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:40:07,207 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/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 02:40:07,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:07,219 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:40:07,252 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/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-01-10 02:40:07,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:07,263 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:40:07,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07 WrapperNode [2022-01-10 02:40:07,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:07,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:07,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:40:07,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:40:07,279 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:40:07" (1/1) ... [2022-01-10 02:40:07,289 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:40:07" (1/1) ... [2022-01-10 02:40:07,323 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 481 [2022-01-10 02:40:07,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:07,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:40:07,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:40:07,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:40:07,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:40:07,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:40:07,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:40:07,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:40:07,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:40:07,424 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:40:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:40:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:40:07,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:40:07,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:40:07,462 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:40:07,512 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:40:07,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:40:07,522 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 02:40:07,785 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 02:40:07,786 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 02:40:07,786 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:40:07,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:40:07,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 02:40:07,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:07 BoogieIcfgContainer [2022-01-10 02:40:07,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:40:07,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:40:07,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:40:07,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:40:07,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:06" (1/3) ... [2022-01-10 02:40:07,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7061e1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:07, skipping insertion in model container [2022-01-10 02:40:07,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (2/3) ... [2022-01-10 02:40:07,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7061e1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:07, skipping insertion in model container [2022-01-10 02:40:07,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:07" (3/3) ... [2022-01-10 02:40:07,798 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2022-01-10 02:40:07,801 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:40:07,802 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:40:07,832 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:40:07,847 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:40:07,848 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:40:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 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:40:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 02:40:07,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:07,866 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, 1, 1, 1, 1, 1] [2022-01-10 02:40:07,866 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2022-01-10 02:40:07,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:07,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566857349] [2022-01-10 02:40:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:07,879 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:07,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:07,881 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:40:07,882 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:40:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:07,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:07,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:08,141 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:40:08,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:08,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566857349] [2022-01-10 02:40:08,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566857349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:08,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:08,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:08,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521250651] [2022-01-10 02:40:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:08,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:08,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:08,174 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 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 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:40:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:08,333 INFO L93 Difference]: Finished difference Result 301 states and 513 transitions. [2022-01-10 02:40:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-10 02:40:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:08,345 INFO L225 Difference]: With dead ends: 301 [2022-01-10 02:40:08,345 INFO L226 Difference]: Without dead ends: 147 [2022-01-10 02:40:08,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:40:08,351 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:08,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 364 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-01-10 02:40:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-01-10 02:40:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 143 states have internal predecessors, (218), 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:40:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2022-01-10 02:40:08,392 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 44 [2022-01-10 02:40:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:08,392 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2022-01-10 02:40:08,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:40:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2022-01-10 02:40:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 02:40:08,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:08,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:08,404 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:40:08,603 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:40:08,604 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash -193922812, now seen corresponding path program 1 times [2022-01-10 02:40:08,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:08,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518723224] [2022-01-10 02:40:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:08,605 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:08,606 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:40:08,608 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:40:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:08,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:08,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:40:08,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:08,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518723224] [2022-01-10 02:40:08,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518723224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:08,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:08,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:08,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944667585] [2022-01-10 02:40:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:08,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:08,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:08,751 INFO L87 Difference]: Start difference. First operand 144 states and 218 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:40:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:08,849 INFO L93 Difference]: Finished difference Result 305 states and 468 transitions. [2022-01-10 02:40:08,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:08,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2022-01-10 02:40:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:08,851 INFO L225 Difference]: With dead ends: 305 [2022-01-10 02:40:08,851 INFO L226 Difference]: Without dead ends: 169 [2022-01-10 02:40:08,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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:40:08,852 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:08,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-01-10 02:40:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2022-01-10 02:40:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 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:40:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2022-01-10 02:40:08,873 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 60 [2022-01-10 02:40:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:08,874 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2022-01-10 02:40:08,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:40:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2022-01-10 02:40:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:08,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:08,876 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:08,898 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:40:09,082 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:40:09,082 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -751274889, now seen corresponding path program 1 times [2022-01-10 02:40:09,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380255556] [2022-01-10 02:40:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,084 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,085 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:40:09,090 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:40:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:09,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380255556] [2022-01-10 02:40:09,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380255556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315427620] [2022-01-10 02:40:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,322 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:40:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,432 INFO L93 Difference]: Finished difference Result 368 states and 559 transitions. [2022-01-10 02:40:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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) Word has length 81 [2022-01-10 02:40:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,435 INFO L225 Difference]: With dead ends: 368 [2022-01-10 02:40:09,435 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 02:40:09,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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:40:09,440 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 15 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:09,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 287 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 02:40:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2022-01-10 02:40:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.412621359223301) internal successors, (291), 206 states have internal predecessors, (291), 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:40:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2022-01-10 02:40:09,471 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 81 [2022-01-10 02:40:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,472 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2022-01-10 02:40:09,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:40:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2022-01-10 02:40:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:09,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:09,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:09,674 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:40:09,674 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -503128395, now seen corresponding path program 1 times [2022-01-10 02:40:09,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656585236] [2022-01-10 02:40:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,676 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,677 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:40:09,678 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:40:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:09,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656585236] [2022-01-10 02:40:09,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656585236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464287149] [2022-01-10 02:40:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,827 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:40:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,909 INFO L93 Difference]: Finished difference Result 432 states and 616 transitions. [2022-01-10 02:40:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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) Word has length 81 [2022-01-10 02:40:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,911 INFO L225 Difference]: With dead ends: 432 [2022-01-10 02:40:09,911 INFO L226 Difference]: Without dead ends: 233 [2022-01-10 02:40:09,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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:40:09,912 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:09,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-01-10 02:40:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2022-01-10 02:40:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 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:40:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2022-01-10 02:40:09,918 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 81 [2022-01-10 02:40:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,918 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2022-01-10 02:40:09,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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:40:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2022-01-10 02:40:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:40:09,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,920 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:09,933 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:40:10,126 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:40:10,127 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash 356294499, now seen corresponding path program 1 times [2022-01-10 02:40:10,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788301717] [2022-01-10 02:40:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,128 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,129 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:40:10,131 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:40:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:10,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788301717] [2022-01-10 02:40:10,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788301717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853884013] [2022-01-10 02:40:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,329 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:40:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,415 INFO L93 Difference]: Finished difference Result 489 states and 692 transitions. [2022-01-10 02:40:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 101 [2022-01-10 02:40:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,419 INFO L225 Difference]: With dead ends: 489 [2022-01-10 02:40:10,419 INFO L226 Difference]: Without dead ends: 267 [2022-01-10 02:40:10,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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:40:10,420 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 305 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-01-10 02:40:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 255. [2022-01-10 02:40:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.374015748031496) internal successors, (349), 254 states have internal predecessors, (349), 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:40:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2022-01-10 02:40:10,433 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 101 [2022-01-10 02:40:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,433 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2022-01-10 02:40:10,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:40:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2022-01-10 02:40:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:10,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,438 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:10,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 02:40:10,644 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:40:10,645 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2022-01-10 02:40:10,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863434348] [2022-01-10 02:40:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,647 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:40:10,648 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:40:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:10,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863434348] [2022-01-10 02:40:10,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863434348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910182011] [2022-01-10 02:40:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,843 INFO L87 Difference]: Start difference. First operand 255 states and 349 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:40:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,863 INFO L93 Difference]: Finished difference Result 743 states and 1017 transitions. [2022-01-10 02:40:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 121 [2022-01-10 02:40:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,865 INFO L225 Difference]: With dead ends: 743 [2022-01-10 02:40:10,865 INFO L226 Difference]: Without dead ends: 496 [2022-01-10 02:40:10,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:40:10,869 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 131 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-01-10 02:40:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-01-10 02:40:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.3616161616161617) internal successors, (674), 495 states have internal predecessors, (674), 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:40:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 674 transitions. [2022-01-10 02:40:10,877 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 674 transitions. Word has length 121 [2022-01-10 02:40:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,877 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 674 transitions. [2022-01-10 02:40:10,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:40:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 674 transitions. [2022-01-10 02:40:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:10,878 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,878 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:10,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 02:40:11,084 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:40:11,085 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash -785218416, now seen corresponding path program 1 times [2022-01-10 02:40:11,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075732043] [2022-01-10 02:40:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,087 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:40:11,088 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:40:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:11,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,285 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075732043] [2022-01-10 02:40:11,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075732043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818121627] [2022-01-10 02:40:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,286 INFO L87 Difference]: Start difference. First operand 496 states and 674 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:40:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,308 INFO L93 Difference]: Finished difference Result 1227 states and 1670 transitions. [2022-01-10 02:40:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2022-01-10 02:40:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,311 INFO L225 Difference]: With dead ends: 1227 [2022-01-10 02:40:11,311 INFO L226 Difference]: Without dead ends: 739 [2022-01-10 02:40:11,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:40:11,312 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 133 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-01-10 02:40:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2022-01-10 02:40:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.3577235772357723) internal successors, (1002), 738 states have internal predecessors, (1002), 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:40:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1002 transitions. [2022-01-10 02:40:11,323 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1002 transitions. Word has length 121 [2022-01-10 02:40:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,324 INFO L470 AbstractCegarLoop]: Abstraction has 739 states and 1002 transitions. [2022-01-10 02:40:11,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:40:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1002 transitions. [2022-01-10 02:40:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:11,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,325 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:11,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 02:40:11,531 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:40:11,532 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1630617934, now seen corresponding path program 1 times [2022-01-10 02:40:11,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115638630] [2022-01-10 02:40:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,533 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,534 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:40:11,540 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:40:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 02:40:11,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,761 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115638630] [2022-01-10 02:40:11,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115638630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429614071] [2022-01-10 02:40:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,763 INFO L87 Difference]: Start difference. First operand 739 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:40:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,778 INFO L93 Difference]: Finished difference Result 1494 states and 2022 transitions. [2022-01-10 02:40:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 121 [2022-01-10 02:40:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,781 INFO L225 Difference]: With dead ends: 1494 [2022-01-10 02:40:11,781 INFO L226 Difference]: Without dead ends: 763 [2022-01-10 02:40:11,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:40:11,782 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-01-10 02:40:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2022-01-10 02:40:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.353018372703412) internal successors, (1031), 762 states have internal predecessors, (1031), 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:40:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1031 transitions. [2022-01-10 02:40:11,795 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1031 transitions. Word has length 121 [2022-01-10 02:40:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,796 INFO L470 AbstractCegarLoop]: Abstraction has 763 states and 1031 transitions. [2022-01-10 02:40:11,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:40:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1031 transitions. [2022-01-10 02:40:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:11,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,797 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:11,805 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:40:12,003 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:40:12,006 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -402776112, now seen corresponding path program 1 times [2022-01-10 02:40:12,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014999084] [2022-01-10 02:40:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,007 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,007 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:40:12,009 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:40:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-10 02:40:12,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014999084] [2022-01-10 02:40:12,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014999084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101424182] [2022-01-10 02:40:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,168 INFO L87 Difference]: Start difference. First operand 763 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:40:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,184 INFO L93 Difference]: Finished difference Result 1531 states and 2064 transitions. [2022-01-10 02:40:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 121 [2022-01-10 02:40:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,187 INFO L225 Difference]: With dead ends: 1531 [2022-01-10 02:40:12,187 INFO L226 Difference]: Without dead ends: 776 [2022-01-10 02:40:12,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:40:12,189 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-01-10 02:40:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2022-01-10 02:40:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 1.3470967741935485) internal successors, (1044), 775 states have internal predecessors, (1044), 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:40:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1044 transitions. [2022-01-10 02:40:12,200 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1044 transitions. Word has length 121 [2022-01-10 02:40:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,200 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 1044 transitions. [2022-01-10 02:40:12,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:40:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1044 transitions. [2022-01-10 02:40:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 02:40:12,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,202 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:40:12,210 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:40:12,408 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:40:12,409 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -541828422, now seen corresponding path program 1 times [2022-01-10 02:40:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782567624] [2022-01-10 02:40:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,410 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,411 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:40:12,413 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:40:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:12,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,625 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782567624] [2022-01-10 02:40:12,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782567624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950697536] [2022-01-10 02:40:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,626 INFO L87 Difference]: Start difference. First operand 776 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:40:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,732 INFO L93 Difference]: Finished difference Result 1629 states and 2238 transitions. [2022-01-10 02:40:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 159 [2022-01-10 02:40:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,735 INFO L225 Difference]: With dead ends: 1629 [2022-01-10 02:40:12,735 INFO L226 Difference]: Without dead ends: 874 [2022-01-10 02:40:12,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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:40:12,736 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 20 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 302 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-01-10 02:40:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 860. [2022-01-10 02:40:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 1.3247962747380675) internal successors, (1138), 859 states have internal predecessors, (1138), 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:40:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1138 transitions. [2022-01-10 02:40:12,780 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1138 transitions. Word has length 159 [2022-01-10 02:40:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,781 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1138 transitions. [2022-01-10 02:40:12,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:40:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1138 transitions. [2022-01-10 02:40:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 02:40:12,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,783 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-01-10 02:40:12,804 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:40:12,983 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:40:12,983 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2093330807, now seen corresponding path program 1 times [2022-01-10 02:40:12,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450708687] [2022-01-10 02:40:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,984 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,985 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:40:13,009 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:40:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-10 02:40:13,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:13,258 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:13,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450708687] [2022-01-10 02:40:13,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450708687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:13,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:13,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:13,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765782919] [2022-01-10 02:40:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:13,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:13,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,261 INFO L87 Difference]: Start difference. First operand 860 states and 1138 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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:40:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:13,362 INFO L93 Difference]: Finished difference Result 1792 states and 2425 transitions. [2022-01-10 02:40:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:13,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 202 [2022-01-10 02:40:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:13,364 INFO L225 Difference]: With dead ends: 1792 [2022-01-10 02:40:13,365 INFO L226 Difference]: Without dead ends: 953 [2022-01-10 02:40:13,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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:40:13,366 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:13,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 299 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-01-10 02:40:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-01-10 02:40:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.3088235294117647) internal successors, (1246), 952 states have internal predecessors, (1246), 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:40:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1246 transitions. [2022-01-10 02:40:13,379 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1246 transitions. Word has length 202 [2022-01-10 02:40:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:13,379 INFO L470 AbstractCegarLoop]: Abstraction has 953 states and 1246 transitions. [2022-01-10 02:40:13,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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:40:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1246 transitions. [2022-01-10 02:40:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-10 02:40:13,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:13,381 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:13,404 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:40:13,588 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:40:13,588 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -890289059, now seen corresponding path program 1 times [2022-01-10 02:40:13,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:13,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028464546] [2022-01-10 02:40:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:13,589 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:13,593 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:40:13,594 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:40:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 02:40:13,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:13,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:13,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028464546] [2022-01-10 02:40:13,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028464546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:13,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:13,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:13,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410856005] [2022-01-10 02:40:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:13,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:13,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,873 INFO L87 Difference]: Start difference. First operand 953 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:40:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:13,978 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2022-01-10 02:40:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 231 [2022-01-10 02:40:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:13,980 INFO L225 Difference]: With dead ends: 2014 [2022-01-10 02:40:13,981 INFO L226 Difference]: Without dead ends: 948 [2022-01-10 02:40:13,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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:40:13,982 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:13,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 306 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-01-10 02:40:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2022-01-10 02:40:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 1.3051742344244983) internal successors, (1236), 947 states have internal predecessors, (1236), 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:40:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1236 transitions. [2022-01-10 02:40:13,994 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1236 transitions. Word has length 231 [2022-01-10 02:40:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:13,994 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1236 transitions. [2022-01-10 02:40:13,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:40:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1236 transitions. [2022-01-10 02:40:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-01-10 02:40:13,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:13,996 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:14,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 02:40:14,202 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:40:14,203 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2022-01-10 02:40:14,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:14,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741015222] [2022-01-10 02:40:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:14,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:14,205 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:40:14,206 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:40:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:14,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:14,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-10 02:40:14,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:14,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741015222] [2022-01-10 02:40:14,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741015222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:14,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:14,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:14,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754007012] [2022-01-10 02:40:14,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:14,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:14,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:14,685 INFO L87 Difference]: Start difference. First operand 948 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:40:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:14,707 INFO L93 Difference]: Finished difference Result 2685 states and 3521 transitions. [2022-01-10 02:40:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 271 [2022-01-10 02:40:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:14,711 INFO L225 Difference]: With dead ends: 2685 [2022-01-10 02:40:14,711 INFO L226 Difference]: Without dead ends: 1194 [2022-01-10 02:40:14,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 269 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:40:14,713 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:14,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 515 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-01-10 02:40:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1192. [2022-01-10 02:40:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 1.3073047858942066) internal successors, (1557), 1191 states have internal predecessors, (1557), 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:40:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1557 transitions. [2022-01-10 02:40:14,730 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1557 transitions. Word has length 271 [2022-01-10 02:40:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:14,730 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 1557 transitions. [2022-01-10 02:40:14,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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:40:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1557 transitions. [2022-01-10 02:40:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2022-01-10 02:40:14,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:14,732 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:14,741 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:40:14,939 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:40:14,939 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1891635766, now seen corresponding path program 1 times [2022-01-10 02:40:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:14,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442119577] [2022-01-10 02:40:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:14,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:14,941 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:40:14,943 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:40:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:15,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:15,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-01-10 02:40:15,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:15,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:15,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442119577] [2022-01-10 02:40:15,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442119577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:15,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:15,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:15,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322818112] [2022-01-10 02:40:15,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:15,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:15,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:15,549 INFO L87 Difference]: Start difference. First operand 1192 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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:40:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:15,677 INFO L93 Difference]: Finished difference Result 2499 states and 3333 transitions. [2022-01-10 02:40:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:15,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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) Word has length 317 [2022-01-10 02:40:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:15,680 INFO L225 Difference]: With dead ends: 2499 [2022-01-10 02:40:15,680 INFO L226 Difference]: Without dead ends: 1328 [2022-01-10 02:40:15,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 315 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:40:15,681 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:15,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 300 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-01-10 02:40:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1300. [2022-01-10 02:40:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.2971516551193225) internal successors, (1685), 1299 states have internal predecessors, (1685), 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:40:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1685 transitions. [2022-01-10 02:40:15,697 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1685 transitions. Word has length 317 [2022-01-10 02:40:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:15,697 INFO L470 AbstractCegarLoop]: Abstraction has 1300 states and 1685 transitions. [2022-01-10 02:40:15,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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:40:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1685 transitions. [2022-01-10 02:40:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-01-10 02:40:15,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:15,699 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:15,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-01-10 02:40:15,906 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:40:15,906 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1795423714, now seen corresponding path program 1 times [2022-01-10 02:40:15,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176428622] [2022-01-10 02:40:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:15,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:15,924 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:40:15,939 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:40:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:16,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:16,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-01-10 02:40:16,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:16,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:16,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176428622] [2022-01-10 02:40:16,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176428622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:16,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:16,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:16,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071309957] [2022-01-10 02:40:16,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:16,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:16,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:16,461 INFO L87 Difference]: Start difference. First operand 1300 states and 1685 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:40:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:16,577 INFO L93 Difference]: Finished difference Result 2703 states and 3565 transitions. [2022-01-10 02:40:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 340 [2022-01-10 02:40:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:16,580 INFO L225 Difference]: With dead ends: 2703 [2022-01-10 02:40:16,580 INFO L226 Difference]: Without dead ends: 1424 [2022-01-10 02:40:16,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 338 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:40:16,583 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:16,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-01-10 02:40:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1416. [2022-01-10 02:40:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.2869257950530035) internal successors, (1821), 1415 states have internal predecessors, (1821), 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:40:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1821 transitions. [2022-01-10 02:40:16,604 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1821 transitions. Word has length 340 [2022-01-10 02:40:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:16,604 INFO L470 AbstractCegarLoop]: Abstraction has 1416 states and 1821 transitions. [2022-01-10 02:40:16,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:40:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1821 transitions. [2022-01-10 02:40:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-01-10 02:40:16,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:16,608 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:16,615 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:40:16,815 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:40:16,815 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2022-01-10 02:40:16,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928407821] [2022-01-10 02:40:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:16,816 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:16,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:16,817 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:40:16,818 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:40:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:16,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:16,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2022-01-10 02:40:17,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:17,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:17,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928407821] [2022-01-10 02:40:17,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928407821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:17,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:17,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:17,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149556644] [2022-01-10 02:40:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:17,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:17,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:17,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,300 INFO L87 Difference]: Start difference. First operand 1416 states and 1821 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:40:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:17,323 INFO L93 Difference]: Finished difference Result 4198 states and 5401 transitions. [2022-01-10 02:40:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 373 [2022-01-10 02:40:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:17,329 INFO L225 Difference]: With dead ends: 4198 [2022-01-10 02:40:17,329 INFO L226 Difference]: Without dead ends: 2803 [2022-01-10 02:40:17,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 371 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:40:17,331 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:17,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 412 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2022-01-10 02:40:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2801. [2022-01-10 02:40:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2800 states have (on average 1.2842857142857143) internal successors, (3596), 2800 states have internal predecessors, (3596), 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:40:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3596 transitions. [2022-01-10 02:40:17,363 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3596 transitions. Word has length 373 [2022-01-10 02:40:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:17,363 INFO L470 AbstractCegarLoop]: Abstraction has 2801 states and 3596 transitions. [2022-01-10 02:40:17,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:40:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3596 transitions. [2022-01-10 02:40:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-01-10 02:40:17,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:17,366 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:17,376 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:40:17,574 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:40:17,575 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1193592354, now seen corresponding path program 1 times [2022-01-10 02:40:17,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:17,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489159534] [2022-01-10 02:40:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:17,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:17,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:17,577 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:40:17,578 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:40:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:17,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:17,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 876 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-01-10 02:40:18,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 876 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-01-10 02:40:18,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489159534] [2022-01-10 02:40:18,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489159534] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:18,517 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:18,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 02:40:18,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103255043] [2022-01-10 02:40:18,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:18,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:18,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:18,518 INFO L87 Difference]: Start difference. First operand 2801 states and 3596 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:40:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:18,685 INFO L93 Difference]: Finished difference Result 8673 states and 11282 transitions. [2022-01-10 02:40:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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 374 [2022-01-10 02:40:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:18,701 INFO L225 Difference]: With dead ends: 8673 [2022-01-10 02:40:18,702 INFO L226 Difference]: Without dead ends: 5893 [2022-01-10 02:40:18,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 745 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:40:18,706 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 169 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:18,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 631 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2022-01-10 02:40:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 3769. [2022-01-10 02:40:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 3768 states have (on average 1.3110403397027601) internal successors, (4940), 3768 states have internal predecessors, (4940), 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:40:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 4940 transitions. [2022-01-10 02:40:18,775 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 4940 transitions. Word has length 374 [2022-01-10 02:40:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:18,775 INFO L470 AbstractCegarLoop]: Abstraction has 3769 states and 4940 transitions. [2022-01-10 02:40:18,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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:40:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 4940 transitions. [2022-01-10 02:40:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-01-10 02:40:18,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:18,800 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:18,817 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:40:19,007 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:40:19,008 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1453642420, now seen corresponding path program 1 times [2022-01-10 02:40:19,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403237456] [2022-01-10 02:40:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,010 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:40:19,011 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:40:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:19,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:19,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 917 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-01-10 02:40:19,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:19,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:19,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403237456] [2022-01-10 02:40:19,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403237456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:19,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:19,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:19,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620658395] [2022-01-10 02:40:19,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:19,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:19,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:19,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:19,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:19,550 INFO L87 Difference]: Start difference. First operand 3769 states and 4940 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:40:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:19,654 INFO L93 Difference]: Finished difference Result 7863 states and 10443 transitions. [2022-01-10 02:40:19,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 404 [2022-01-10 02:40:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:19,665 INFO L225 Difference]: With dead ends: 7863 [2022-01-10 02:40:19,665 INFO L226 Difference]: Without dead ends: 4115 [2022-01-10 02:40:19,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 402 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:40:19,669 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:19,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 306 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2022-01-10 02:40:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3929. [2022-01-10 02:40:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3928 states have (on average 1.3085539714867618) internal successors, (5140), 3928 states have internal predecessors, (5140), 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:40:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5140 transitions. [2022-01-10 02:40:19,722 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5140 transitions. Word has length 404 [2022-01-10 02:40:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:19,723 INFO L470 AbstractCegarLoop]: Abstraction has 3929 states and 5140 transitions. [2022-01-10 02:40:19,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:40:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5140 transitions. [2022-01-10 02:40:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2022-01-10 02:40:19,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:19,726 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:19,736 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:40:19,934 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:40:19,934 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1756109688, now seen corresponding path program 1 times [2022-01-10 02:40:19,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665964363] [2022-01-10 02:40:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,936 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,937 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:40:19,968 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:40:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:20,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:20,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2022-01-10 02:40:20,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:20,477 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665964363] [2022-01-10 02:40:20,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665964363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:20,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:20,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:20,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337584334] [2022-01-10 02:40:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:20,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:20,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:20,478 INFO L87 Difference]: Start difference. First operand 3929 states and 5140 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:40:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:20,618 INFO L93 Difference]: Finished difference Result 8413 states and 11295 transitions. [2022-01-10 02:40:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:20,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 405 [2022-01-10 02:40:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:20,630 INFO L225 Difference]: With dead ends: 8413 [2022-01-10 02:40:20,630 INFO L226 Difference]: Without dead ends: 4505 [2022-01-10 02:40:20,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 403 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:40:20,633 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:20,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2022-01-10 02:40:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4473. [2022-01-10 02:40:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 4472 states have (on average 1.2889087656529516) internal successors, (5764), 4472 states have internal predecessors, (5764), 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:40:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 5764 transitions. [2022-01-10 02:40:20,700 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 5764 transitions. Word has length 405 [2022-01-10 02:40:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:20,700 INFO L470 AbstractCegarLoop]: Abstraction has 4473 states and 5764 transitions. [2022-01-10 02:40:20,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:40:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 5764 transitions. [2022-01-10 02:40:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2022-01-10 02:40:20,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:20,705 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:20,721 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:40:20,912 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:40:20,912 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -11640254, now seen corresponding path program 1 times [2022-01-10 02:40:20,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:20,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724499573] [2022-01-10 02:40:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:20,913 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:20,915 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:40:20,943 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:40:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:20,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 1163 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2022-01-10 02:40:21,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:21,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:21,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724499573] [2022-01-10 02:40:21,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724499573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:21,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:21,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:21,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936387964] [2022-01-10 02:40:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:21,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:21,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:21,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:21,430 INFO L87 Difference]: Start difference. First operand 4473 states and 5764 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:40:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:21,577 INFO L93 Difference]: Finished difference Result 9533 states and 12607 transitions. [2022-01-10 02:40:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 436 [2022-01-10 02:40:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:21,597 INFO L225 Difference]: With dead ends: 9533 [2022-01-10 02:40:21,598 INFO L226 Difference]: Without dead ends: 5081 [2022-01-10 02:40:21,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 434 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:40:21,601 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:21,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2022-01-10 02:40:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5049. [2022-01-10 02:40:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5049 states, 5048 states have (on average 1.2717908082408875) internal successors, (6420), 5048 states have internal predecessors, (6420), 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:40:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5049 states to 5049 states and 6420 transitions. [2022-01-10 02:40:21,722 INFO L78 Accepts]: Start accepts. Automaton has 5049 states and 6420 transitions. Word has length 436 [2022-01-10 02:40:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:21,723 INFO L470 AbstractCegarLoop]: Abstraction has 5049 states and 6420 transitions. [2022-01-10 02:40:21,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:40:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 5049 states and 6420 transitions. [2022-01-10 02:40:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-01-10 02:40:21,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:21,733 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:21,742 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:40:21,944 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:40:21,944 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1411824547, now seen corresponding path program 1 times [2022-01-10 02:40:21,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:21,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586933137] [2022-01-10 02:40:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:21,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:21,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:21,960 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:40:21,961 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:40:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:22,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:22,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 1352 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2022-01-10 02:40:22,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:22,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586933137] [2022-01-10 02:40:22,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586933137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:22,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:22,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:22,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032047391] [2022-01-10 02:40:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:22,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:22,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:22,611 INFO L87 Difference]: Start difference. First operand 5049 states and 6420 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:40:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:22,741 INFO L93 Difference]: Finished difference Result 9863 states and 12653 transitions. [2022-01-10 02:40:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 469 [2022-01-10 02:40:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:22,746 INFO L225 Difference]: With dead ends: 9863 [2022-01-10 02:40:22,746 INFO L226 Difference]: Without dead ends: 4385 [2022-01-10 02:40:22,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 467 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:40:22,750 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:22,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 300 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2022-01-10 02:40:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 3907. [2022-01-10 02:40:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 3906 states have (on average 1.230926779313876) internal successors, (4808), 3906 states have internal predecessors, (4808), 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:40:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 4808 transitions. [2022-01-10 02:40:22,816 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 4808 transitions. Word has length 469 [2022-01-10 02:40:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:22,816 INFO L470 AbstractCegarLoop]: Abstraction has 3907 states and 4808 transitions. [2022-01-10 02:40:22,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:40:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 4808 transitions. [2022-01-10 02:40:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2022-01-10 02:40:22,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:22,820 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:22,836 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:40:23,027 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:40:23,028 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2021178619, now seen corresponding path program 1 times [2022-01-10 02:40:23,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:23,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842290579] [2022-01-10 02:40:23,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:23,029 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:23,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:23,030 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:40:23,031 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:40:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:23,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1309 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2022-01-10 02:40:23,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1309 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2022-01-10 02:40:24,263 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:24,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842290579] [2022-01-10 02:40:24,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842290579] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:24,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:24,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:24,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986991405] [2022-01-10 02:40:24,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:24,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:24,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:24,265 INFO L87 Difference]: Start difference. First operand 3907 states and 4808 transitions. Second operand has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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:40:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:24,527 INFO L93 Difference]: Finished difference Result 5234 states and 6445 transitions. [2022-01-10 02:40:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:40:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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 507 [2022-01-10 02:40:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:24,528 INFO L225 Difference]: With dead ends: 5234 [2022-01-10 02:40:24,528 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:40:24,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:40:24,531 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 249 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:24,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 490 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:40:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:40:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:40:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:40:24,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 507 [2022-01-10 02:40:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:24,532 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:40:24,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 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:40:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:40:24,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:40:24,534 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:40:24,553 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:40:24,741 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:40:24,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:40:26,511 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-01-10 02:40:26,511 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-01-10 02:40:26,511 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-01-10 02:40:26,511 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L861 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L854 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse5 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse9 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32)) .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse0 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse4 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse5) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse0 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse4) (and .cse0 .cse7 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse8 .cse7) (and .cse0 .cse7 .cse5) (and .cse0 .cse6 .cse1) (and .cse0 .cse7 .cse3) (and .cse0 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse8) (and .cse0 .cse9 .cse7) (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (and .cse2 .cse9) (and .cse0 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse0 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L854 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,512 INFO L854 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L854 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))))) [2022-01-10 02:40:26,513 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L861 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-01-10 02:40:26,513 INFO L854 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse5 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse9 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32)) .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse0 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse4 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse5) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse0 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse4) (and .cse0 .cse7 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8464 32)) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))) (and .cse0 .cse8 .cse7) (and .cse0 .cse7 .cse5) (and .cse0 .cse6 .cse1) (and .cse0 .cse7 .cse3) (and .cse0 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse8) (and .cse0 .cse9 .cse7) (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (and .cse2 .cse9) (and .cse0 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse0 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) [2022-01-10 02:40:26,513 INFO L854 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse1) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)) .cse1) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse1))) [2022-01-10 02:40:26,513 INFO L854 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse2 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 .cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))))) [2022-01-10 02:40:26,513 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-01-10 02:40:26,514 INFO L854 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32)))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse1 .cse0))) [2022-01-10 02:40:26,514 INFO L854 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L861 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: true [2022-01-10 02:40:26,515 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))))) [2022-01-10 02:40:26,515 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse2 .cse3) (and .cse1 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse0 .cse2))) [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L854 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-01-10 02:40:26,515 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: true [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-01-10 02:40:26,516 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)))) [2022-01-10 02:40:26,516 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,516 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L854 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,517 INFO L861 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L861 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-01-10 02:40:26,517 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)))) [2022-01-10 02:40:26,518 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2022-01-10 02:40:26,518 INFO L858 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L854 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: false [2022-01-10 02:40:26,519 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-01-10 02:40:26,519 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))))) [2022-01-10 02:40:26,519 INFO L854 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:26,519 INFO L861 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: true [2022-01-10 02:40:26,521 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] [2022-01-10 02:40:26,522 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:40:26,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:26 BoogieIcfgContainer [2022-01-10 02:40:26,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:40:26,542 INFO L158 Benchmark]: Toolchain (without parser) took 19566.18ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 142.0MB in the beginning and 196.7MB in the end (delta: -54.6MB). Peak memory consumption was 194.7MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,542 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:40:26,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.96ms. Allocated memory is still 196.1MB. Free memory was 141.9MB in the beginning and 164.8MB in the end (delta: -23.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.01ms. Allocated memory is still 196.1MB. Free memory was 164.8MB in the beginning and 162.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,543 INFO L158 Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 196.1MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,543 INFO L158 Benchmark]: RCFGBuilder took 418.05ms. Allocated memory is still 196.1MB. Free memory was 159.6MB in the beginning and 133.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,543 INFO L158 Benchmark]: TraceAbstraction took 18744.64ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 133.4MB in the beginning and 196.7MB in the end (delta: -63.3MB). Peak memory consumption was 186.0MB. Max. memory is 8.0GB. [2022-01-10 02:40:26,544 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.10ms. Allocated memory is still 196.1MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.96ms. Allocated memory is still 196.1MB. Free memory was 141.9MB in the beginning and 164.8MB in the end (delta: -23.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.01ms. Allocated memory is still 196.1MB. Free memory was 164.8MB in the beginning and 162.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.24ms. Allocated memory is still 196.1MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 418.05ms. Allocated memory is still 196.1MB. Free memory was 159.6MB in the beginning and 133.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18744.64ms. Allocated memory was 196.1MB in the beginning and 339.7MB in the end (delta: 143.7MB). Free memory was 133.4MB in the beginning and 196.7MB in the end (delta: -63.3MB). Peak memory consumption was 186.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 - PositiveResult [Line: 681]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1184 mSDsluCounter, 8013 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3152 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2238 IncrementalHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 4861 mSDtfsCounter, 2238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6204 GetRequests, 6174 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5049occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 2932 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 274 NumberOfFragments, 866 HoareAnnotationTreeSize, 29 FomulaSimplifications, 962 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 29 FomulaSimplificationsInter, 3038 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 5339 NumberOfCodeBlocks, 5339 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6196 ConstructedInterpolants, 0 QuantifiedInterpolants, 8453 SizeOfPredicates, 5 NumberOfNonLiveVariables, 6279 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 21506/21610 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && 8640bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32)) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((blastFlag == 3bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8448bv32 == s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((blastFlag == 2bv32 && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && 8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (blastFlag == 2bv32 && 8560bv32 == s__state)) || ((blastFlag == 3bv32 && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (blastFlag == 2bv32 && 8544bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || ((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8640bv32 == s__state)) || (blastFlag == 2bv32 && 8512bv32 == s__state)) || (!(s__hit == 0bv32) && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || 3bv32 == s__state) || (!(s__hit == 0bv32) && 8608bv32 == s__state)) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (blastFlag == 2bv32 && 8528bv32 == s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || (blastFlag == 1bv32 && !(8640bv32 == s__state))) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (!(s__hit == 0bv32) && blastFlag == 1bv32) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag == 2bv32 && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && 8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (blastFlag == 2bv32 && 8560bv32 == s__state)) || ((blastFlag == 3bv32 && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (blastFlag == 2bv32 && 8544bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || (s__state == 8464bv32 && blastFlag == 0bv32)) || ((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8640bv32 == s__state)) || (blastFlag == 2bv32 && 8512bv32 == s__state)) || (!(s__hit == 0bv32) && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || 3bv32 == s__state) || (!(s__hit == 0bv32) && 8608bv32 == s__state)) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (blastFlag == 2bv32 && 8528bv32 == s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (!(8640bv32 == s__state) && blastFlag == 0bv32) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 02:40:26,609 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...