/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/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:10:43,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:10:43,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:10:43,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:10:43,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:10:43,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:10:43,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:10:43,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:10:43,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:10:43,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:10:43,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:10:43,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:10:43,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:10:43,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:10:43,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:10:43,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:10:43,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:10:43,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:10:43,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:10:43,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:10:43,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:10:43,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:10:43,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:10:43,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:10:43,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:10:43,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:10:43,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:10:43,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:10:43,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:10:43,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:10:43,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:10:43,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:10:43,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:10:43,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:10:43,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:10:43,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:10:43,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:10:43,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:10:43,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:10:43,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:10:43,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:10:43,179 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 04:10:43,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:10:43,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:10:43,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:10:43,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:10:43,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:10:43,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:10:43,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:10:43,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:10:43,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:10:43,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:10:43,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:43,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:10:43,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:10:43,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:10:43,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:10:43,210 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 04:10:43,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:10:43,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:10:43,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:10:43,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:10:43,475 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:10:43,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-01-10 04:10:43,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3ebba01/737f30c508fc4e14918f4d7d3a3127fc/FLAG19f92f956 [2022-01-10 04:10:43,948 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:10:43,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-01-10 04:10:43,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3ebba01/737f30c508fc4e14918f4d7d3a3127fc/FLAG19f92f956 [2022-01-10 04:10:43,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b3ebba01/737f30c508fc4e14918f4d7d3a3127fc [2022-01-10 04:10:43,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:10:43,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:10:43,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:43,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:10:43,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:10:43,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:43" (1/1) ... [2022-01-10 04:10:43,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a46ba40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:43, skipping insertion in model container [2022-01-10 04:10:43,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:10:43" (1/1) ... [2022-01-10 04:10:43,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:10:44,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:10:44,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-01-10 04:10:44,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:44,213 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:10:44,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c[14184,14197] [2022-01-10 04:10:44,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:10:44,288 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:10:44,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44 WrapperNode [2022-01-10 04:10:44,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:10:44,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:44,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:10:44,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:10:44,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,324 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 135 [2022-01-10 04:10:44,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:10:44,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:10:44,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:10:44,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:10:44,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:10:44,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:10:44,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:10:44,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:10:44,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (1/1) ... [2022-01-10 04:10:44,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:10:44,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:10:44,395 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 04:10:44,397 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 04:10:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:10:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:10:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:10:44,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:10:44,480 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:10:44,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:10:44,663 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:10:44,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:10:44,668 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 04:10:44,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:44 BoogieIcfgContainer [2022-01-10 04:10:44,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:10:44,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:10:44,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:10:44,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:10:44,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:10:43" (1/3) ... [2022-01-10 04:10:44,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11afa69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:44, skipping insertion in model container [2022-01-10 04:10:44,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:10:44" (2/3) ... [2022-01-10 04:10:44,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11afa69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:10:44, skipping insertion in model container [2022-01-10 04:10:44,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:10:44" (3/3) ... [2022-01-10 04:10:44,677 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-01-10 04:10:44,681 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:10:44,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:10:44,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:10:44,759 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 04:10:44,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:10:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 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 04:10:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 04:10:44,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:44,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 04:10:44,789 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 28699930, now seen corresponding path program 1 times [2022-01-10 04:10:44,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:44,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428266430] [2022-01-10 04:10:44,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:44,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:44,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:44,811 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 04:10:44,850 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 04:10:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:44,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:44,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:44,955 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 04:10:44,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:44,956 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428266430] [2022-01-10 04:10:44,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428266430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:44,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:44,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:44,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573091527] [2022-01-10 04:10:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:44,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:44,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:44,992 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 45 states have internal predecessors, (75), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 04:10:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:45,085 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2022-01-10 04:10:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-01-10 04:10:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:45,101 INFO L225 Difference]: With dead ends: 131 [2022-01-10 04:10:45,101 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 04:10:45,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 04:10:45,107 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:45,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 04:10:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-01-10 04:10:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 78 states have internal predecessors, (121), 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 04:10:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2022-01-10 04:10:45,162 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 5 [2022-01-10 04:10:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:45,163 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2022-01-10 04:10:45,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 04:10:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2022-01-10 04:10:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 04:10:45,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:45,164 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:45,178 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 04:10:45,378 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 04:10:45,378 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1485309586, now seen corresponding path program 1 times [2022-01-10 04:10:45,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:45,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804979662] [2022-01-10 04:10:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:45,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:45,384 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 04:10:45,386 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 04:10:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:45,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:45,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:10:45,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:45,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804979662] [2022-01-10 04:10:45,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804979662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:45,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:45,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:45,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486628017] [2022-01-10 04:10:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:45,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:45,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:45,453 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 04:10:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:45,521 INFO L93 Difference]: Finished difference Result 156 states and 246 transitions. [2022-01-10 04:10:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-01-10 04:10:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:45,523 INFO L225 Difference]: With dead ends: 156 [2022-01-10 04:10:45,523 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 04:10:45,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 04:10:45,525 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:45,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 161 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 04:10:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-01-10 04:10:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 115 states have internal predecessors, (175), 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 04:10:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 175 transitions. [2022-01-10 04:10:45,538 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 175 transitions. Word has length 10 [2022-01-10 04:10:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:45,539 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 175 transitions. [2022-01-10 04:10:45,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 04:10:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2022-01-10 04:10:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 04:10:45,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:45,543 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:45,554 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 04:10:45,753 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 04:10:45,754 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:45,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1152886494, now seen corresponding path program 1 times [2022-01-10 04:10:45,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899007616] [2022-01-10 04:10:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:45,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:45,757 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 04:10:45,760 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 04:10:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:45,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:45,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 04:10:45,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:45,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899007616] [2022-01-10 04:10:45,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899007616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:45,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:45,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:45,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750979847] [2022-01-10 04:10:45,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:45,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:45,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:45,853 INFO L87 Difference]: Start difference. First operand 116 states and 175 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:45,892 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2022-01-10 04:10:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 04:10:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:45,894 INFO L225 Difference]: With dead ends: 230 [2022-01-10 04:10:45,895 INFO L226 Difference]: Without dead ends: 153 [2022-01-10 04:10:45,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 04:10:45,896 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:45,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-01-10 04:10:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-01-10 04:10:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.513157894736842) internal successors, (230), 152 states have internal predecessors, (230), 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 04:10:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 230 transitions. [2022-01-10 04:10:45,915 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 230 transitions. Word has length 16 [2022-01-10 04:10:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:45,915 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 230 transitions. [2022-01-10 04:10:45,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2022-01-10 04:10:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 04:10:45,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:45,917 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 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 04:10:45,923 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 04:10:46,118 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 04:10:46,118 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -77104047, now seen corresponding path program 1 times [2022-01-10 04:10:46,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786217076] [2022-01-10 04:10:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:46,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:46,123 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 04:10:46,133 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 04:10:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:46,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:46,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 04:10:46,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:46,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786217076] [2022-01-10 04:10:46,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786217076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:46,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:46,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:46,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908915488] [2022-01-10 04:10:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:46,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:46,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:46,223 INFO L87 Difference]: Start difference. First operand 153 states and 230 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:46,313 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-01-10 04:10:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 04:10:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:46,315 INFO L225 Difference]: With dead ends: 321 [2022-01-10 04:10:46,316 INFO L226 Difference]: Without dead ends: 170 [2022-01-10 04:10:46,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 04:10:46,317 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:46,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-10 04:10:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2022-01-10 04:10:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.473053892215569) internal successors, (246), 167 states have internal predecessors, (246), 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 04:10:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2022-01-10 04:10:46,329 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 31 [2022-01-10 04:10:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:46,329 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2022-01-10 04:10:46,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2022-01-10 04:10:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 04:10:46,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:46,331 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 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 04:10:46,354 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 04:10:46,541 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 04:10:46,542 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1611839695, now seen corresponding path program 1 times [2022-01-10 04:10:46,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:46,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010682417] [2022-01-10 04:10:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:46,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:46,545 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 04:10:46,548 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 04:10:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:46,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:46,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 04:10:46,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:46,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010682417] [2022-01-10 04:10:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010682417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:46,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:46,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:46,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781281024] [2022-01-10 04:10:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:46,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:46,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:46,657 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:46,750 INFO L93 Difference]: Finished difference Result 378 states and 567 transitions. [2022-01-10 04:10:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 04:10:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:46,758 INFO L225 Difference]: With dead ends: 378 [2022-01-10 04:10:46,758 INFO L226 Difference]: Without dead ends: 212 [2022-01-10 04:10:46,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 04:10:46,767 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:46,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 86 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-10 04:10:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-01-10 04:10:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 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 04:10:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 285 transitions. [2022-01-10 04:10:46,791 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 285 transitions. Word has length 31 [2022-01-10 04:10:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:46,791 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 285 transitions. [2022-01-10 04:10:46,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 04:10:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 285 transitions. [2022-01-10 04:10:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 04:10:46,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:46,793 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2022-01-10 04:10:46,803 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 04:10:47,002 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 04:10:47,002 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash -359756882, now seen corresponding path program 1 times [2022-01-10 04:10:47,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:47,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191408566] [2022-01-10 04:10:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:47,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:47,005 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 04:10:47,007 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 04:10:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:47,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:47,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 04:10:47,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:47,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:47,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191408566] [2022-01-10 04:10:47,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191408566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:47,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:47,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:47,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220000090] [2022-01-10 04:10:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:47,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:47,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:47,110 INFO L87 Difference]: Start difference. First operand 207 states and 285 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 04:10:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:47,141 INFO L93 Difference]: Finished difference Result 414 states and 577 transitions. [2022-01-10 04:10:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2022-01-10 04:10:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:47,143 INFO L225 Difference]: With dead ends: 414 [2022-01-10 04:10:47,143 INFO L226 Difference]: Without dead ends: 264 [2022-01-10 04:10:47,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 04:10:47,145 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:47,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 163 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-01-10 04:10:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2022-01-10 04:10:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 261 states have internal predecessors, (360), 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 04:10:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2022-01-10 04:10:47,168 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 45 [2022-01-10 04:10:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:47,169 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2022-01-10 04:10:47,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 04:10:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2022-01-10 04:10:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 04:10:47,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:47,172 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2022-01-10 04:10:47,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:47,375 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 04:10:47,375 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1572307813, now seen corresponding path program 1 times [2022-01-10 04:10:47,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:47,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613856530] [2022-01-10 04:10:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:47,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:47,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:47,378 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 04:10:47,380 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 04:10:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:47,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:47,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 04:10:47,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:47,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613856530] [2022-01-10 04:10:47,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613856530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:47,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:47,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:47,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148225392] [2022-01-10 04:10:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:47,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:47,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:47,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:47,499 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 04:10:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:47,566 INFO L93 Difference]: Finished difference Result 546 states and 774 transitions. [2022-01-10 04:10:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 48 [2022-01-10 04:10:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:47,568 INFO L225 Difference]: With dead ends: 546 [2022-01-10 04:10:47,569 INFO L226 Difference]: Without dead ends: 286 [2022-01-10 04:10:47,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 04:10:47,570 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:47,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:10:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-10 04:10:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-01-10 04:10:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.2771929824561403) internal successors, (364), 285 states have internal predecessors, (364), 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 04:10:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2022-01-10 04:10:47,585 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 48 [2022-01-10 04:10:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:47,586 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2022-01-10 04:10:47,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 04:10:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2022-01-10 04:10:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 04:10:47,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:10:47,594 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:47,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:10:47,802 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 04:10:47,803 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:10:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:10:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1777176919, now seen corresponding path program 1 times [2022-01-10 04:10:47,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:10:47,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337776290] [2022-01-10 04:10:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:10:47,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:10:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:10:47,806 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 04:10:47,809 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 04:10:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:10:47,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 04:10:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:10:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 04:10:47,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:10:47,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:10:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337776290] [2022-01-10 04:10:47,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337776290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:10:47,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:10:47,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 04:10:47,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915774051] [2022-01-10 04:10:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:10:47,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 04:10:47,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:10:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 04:10:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 04:10:47,932 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 04:10:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:10:47,958 INFO L93 Difference]: Finished difference Result 692 states and 876 transitions. [2022-01-10 04:10:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 04:10:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 62 [2022-01-10 04:10:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:10:48,008 INFO L225 Difference]: With dead ends: 692 [2022-01-10 04:10:48,008 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 04:10:48,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 04:10:48,009 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:10:48,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 04:10:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 04:10:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 04:10:48,010 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 04:10:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 04:10:48,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2022-01-10 04:10:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:10:48,011 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 04:10:48,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 04:10:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 04:10:48,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 04:10:48,013 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 04:10:48,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 04:10:48,213 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 04:10:48,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 04:10:48,513 INFO L861 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-01-10 04:10:48,513 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 130) no Hoare annotation was computed. [2022-01-10 04:10:48,513 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 207) no Hoare annotation was computed. [2022-01-10 04:10:48,513 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-01-10 04:10:48,513 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 122) no Hoare annotation was computed. [2022-01-10 04:10:48,513 INFO L854 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~s__state~0#1| (_ bv8672 32)))) (or (and .cse0 (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv3 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)))) [2022-01-10 04:10:48,514 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 211) no Hoare annotation was computed. [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~s__state~0#1| (_ bv8640 32)))) (or (and .cse0 (not (= |ULTIMATE.start_main_~s__hit~0#1| (_ bv0 32))) (= (_ bv3 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)))) [2022-01-10 04:10:48,514 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 215) no Hoare annotation was computed. [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,514 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,514 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,514 INFO L854 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,515 INFO L861 garLoopResultBuilder]: At program point L228(lines 20 229) the Hoare annotation is: true [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 197) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 201) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 86 195) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 205) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 86 195) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L854 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= (_ bv3 32) |ULTIMATE.start_main_~blastFlag~0#1|))) (or (and (= |ULTIMATE.start_main_~s__state~0#1| (_ bv8640 32)) (not (= |ULTIMATE.start_main_~s__hit~0#1| (_ bv0 32))) .cse0) (and (= |ULTIMATE.start_main_~s__state~0#1| (_ bv8672 32)) .cse0) (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|))) [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 209) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L854 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,515 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 213) no Hoare annotation was computed. [2022-01-10 04:10:48,515 INFO L854 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,516 INFO L854 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 04:10:48,516 INFO L854 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 92) no Hoare annotation was computed. [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 86 195) no Hoare annotation was computed. [2022-01-10 04:10:48,516 INFO L854 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~s__state~0#1| (_ bv8512 32)))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) (and .cse0 (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|)))) [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 216) no Hoare annotation was computed. [2022-01-10 04:10:48,516 INFO L854 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,516 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L854 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L174-1(lines 174 176) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L854 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (_ bv2 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~blastFlag~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~blastFlag~0#1|)) [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 135) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 195) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L76(lines 76 199) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 203) no Hoare annotation was computed. [2022-01-10 04:10:48,517 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 04:10:48,520 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:10:48,521 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 04:10:48,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:10:48 BoogieIcfgContainer [2022-01-10 04:10:48,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 04:10:48,539 INFO L158 Benchmark]: Toolchain (without parser) took 4564.45ms. Allocated memory was 180.4MB in the beginning and 259.0MB in the end (delta: 78.6MB). Free memory was 122.5MB in the beginning and 206.8MB in the end (delta: -84.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:10:48,539 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 04:10:48,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.57ms. Allocated memory was 180.4MB in the beginning and 259.0MB in the end (delta: 78.6MB). Free memory was 122.3MB in the beginning and 231.1MB in the end (delta: -108.8MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-01-10 04:10:48,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 259.0MB. Free memory was 231.1MB in the beginning and 229.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 04:10:48,541 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 259.0MB. Free memory was 229.5MB in the beginning and 228.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 04:10:48,541 INFO L158 Benchmark]: RCFGBuilder took 303.40ms. Allocated memory is still 259.0MB. Free memory was 228.5MB in the beginning and 214.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 04:10:48,541 INFO L158 Benchmark]: TraceAbstraction took 3866.88ms. Allocated memory is still 259.0MB. Free memory was 213.8MB in the beginning and 206.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-01-10 04:10:48,543 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.14ms. Allocated memory is still 180.4MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.57ms. Allocated memory was 180.4MB in the beginning and 259.0MB in the end (delta: 78.6MB). Free memory was 122.3MB in the beginning and 231.1MB in the end (delta: -108.8MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 259.0MB. Free memory was 231.1MB in the beginning and 229.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 259.0MB. Free memory was 229.5MB in the beginning and 228.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 303.40ms. Allocated memory is still 259.0MB. Free memory was 228.5MB in the beginning and 214.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3866.88ms. Allocated memory is still 259.0MB. Free memory was 213.8MB in the beginning and 206.8MB in the end (delta: 7.0MB). Peak memory consumption was 6.5MB. 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: 227]: 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 1047 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 329 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 718 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 130 NumberOfFragments, 225 HoareAnnotationTreeSize, 18 FomulaSimplifications, 392 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 121 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 SizeOfPredicates, 5 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 180/180 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((s__state == 8672bv32 && 2bv32 == blastFlag) || (s__state == 8672bv32 && 1bv32 == blastFlag)) || (s__state == 8672bv32 && 3bv32 == blastFlag)) || (s__state == 8672bv32 && 0bv32 == blastFlag) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((s__state == 8640bv32 && !(s__hit == 0bv32)) && 3bv32 == blastFlag) || (s__state == 8640bv32 && 1bv32 == blastFlag)) || (s__state == 8640bv32 && 2bv32 == blastFlag)) || (s__state == 8640bv32 && 0bv32 == blastFlag) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((s__state == 8512bv32 && 1bv32 == blastFlag) || (s__state == 8512bv32 && 0bv32 == blastFlag)) || (s__state == 8512bv32 && 2bv32 == blastFlag) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((s__state == 8640bv32 && !(s__hit == 0bv32)) && 3bv32 == blastFlag) || (s__state == 8672bv32 && 3bv32 == blastFlag)) || 2bv32 == blastFlag) || 1bv32 == blastFlag) || 0bv32 == blastFlag - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (2bv32 == blastFlag || 1bv32 == blastFlag) || 0bv32 == blastFlag RESULT: Ultimate proved your program to be correct! [2022-01-10 04:10:48,590 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...