./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:42:47,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:42:47,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:42:47,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:42:47,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:42:47,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:42:47,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:42:47,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:42:47,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:42:47,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:42:47,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:42:47,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:42:47,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:42:47,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:42:47,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:42:48,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:42:48,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:42:48,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:42:48,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:42:48,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:42:48,002 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2025-03-08 04:42:48,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:42:48,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:42:48,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:42:48,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:42:48,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:42:48,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-08 04:42:49,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c35c59a/4566e70024ae4be298d7d9a5357266d2/FLAG2326623fb [2025-03-08 04:42:49,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:42:49,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-08 04:42:49,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c35c59a/4566e70024ae4be298d7d9a5357266d2/FLAG2326623fb [2025-03-08 04:42:49,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c35c59a/4566e70024ae4be298d7d9a5357266d2 [2025-03-08 04:42:49,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:42:49,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:42:49,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:42:49,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:42:49,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:42:49,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331edf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49, skipping insertion in model container [2025-03-08 04:42:49,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:42:49,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2025-03-08 04:42:49,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:42:49,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:42:49,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i[893,906] [2025-03-08 04:42:49,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:42:49,695 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:42:49,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49 WrapperNode [2025-03-08 04:42:49,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:42:49,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:42:49,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:42:49,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:42:49,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,717 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2025-03-08 04:42:49,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:42:49,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:42:49,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:42:49,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:42:49,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,735 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:42:49,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,738 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:42:49,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:42:49,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:42:49,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:42:49,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (1/1) ... [2025-03-08 04:42:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:42:49,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:42:49,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:42:49,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:42:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:42:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:42:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:42:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:42:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:42:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:42:49,849 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:42:49,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:42:49,982 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 04:42:49,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:42:49,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:42:49,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:42:49,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:49 BoogieIcfgContainer [2025-03-08 04:42:49,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:42:49,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:42:49,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:42:49,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:42:49,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:42:49" (1/3) ... [2025-03-08 04:42:49,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736905e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:49, skipping insertion in model container [2025-03-08 04:42:49,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:42:49" (2/3) ... [2025-03-08 04:42:49,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736905e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:42:49, skipping insertion in model container [2025-03-08 04:42:49,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:49" (3/3) ... [2025-03-08 04:42:49,999 INFO L128 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2025-03-08 04:42:50,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:42:50,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sendmail-close-angle.i that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:42:50,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:42:50,060 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ab66f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:42:50,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:42:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 04:42:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:42:50,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:50,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:50,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:50,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2022794257, now seen corresponding path program 1 times [2025-03-08 04:42:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987956740] [2025-03-08 04:42:50,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:42:50,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:42:50,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:50,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:42:50,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:50,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987956740] [2025-03-08 04:42:50,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987956740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:50,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:42:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520916598] [2025-03-08 04:42:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:50,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:42:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:42:50,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:42:50,189 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:42:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:50,203 INFO L93 Difference]: Finished difference Result 55 states and 86 transitions. [2025-03-08 04:42:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:42:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:42:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:50,209 INFO L225 Difference]: With dead ends: 55 [2025-03-08 04:42:50,210 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 04:42:50,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:42:50,214 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:50,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:42:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 04:42:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 04:42:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:42:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-08 04:42:50,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 10 [2025-03-08 04:42:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:50,244 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-08 04:42:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:42:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-08 04:42:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:42:50,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:50,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:42:50,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1662716530, now seen corresponding path program 1 times [2025-03-08 04:42:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716203301] [2025-03-08 04:42:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:42:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:42:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:42:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716203301] [2025-03-08 04:42:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716203301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:50,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:42:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693598628] [2025-03-08 04:42:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:42:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:50,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:42:50,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:42:50,408 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:42:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:50,484 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-03-08 04:42:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:42:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:42:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:50,485 INFO L225 Difference]: With dead ends: 31 [2025-03-08 04:42:50,485 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:42:50,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:42:50,487 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:50,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:42:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 04:42:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:42:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-08 04:42:50,495 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 11 [2025-03-08 04:42:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:50,495 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-08 04:42:50,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:42:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-08 04:42:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:42:50,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:50,496 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:42:50,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1731640948, now seen corresponding path program 1 times [2025-03-08 04:42:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352030654] [2025-03-08 04:42:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:50,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:42:50,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:42:50,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:50,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:42:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:50,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352030654] [2025-03-08 04:42:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352030654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:50,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:42:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038911691] [2025-03-08 04:42:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:50,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:42:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:50,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:42:50,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:42:50,629 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:42:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:50,727 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-03-08 04:42:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:42:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 04:42:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:50,728 INFO L225 Difference]: With dead ends: 44 [2025-03-08 04:42:50,728 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 04:42:50,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:42:50,729 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:50,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 103 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 04:42:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-08 04:42:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:42:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-08 04:42:50,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 16 [2025-03-08 04:42:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:50,735 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-08 04:42:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:42:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2025-03-08 04:42:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:42:50,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:50,736 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:50,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:42:50,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2143869828, now seen corresponding path program 1 times [2025-03-08 04:42:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378642310] [2025-03-08 04:42:50,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:50,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:42:50,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:42:50,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:50,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:42:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378642310] [2025-03-08 04:42:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378642310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:42:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286402068] [2025-03-08 04:42:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:42:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:50,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:42:50,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:42:50,858 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:42:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:50,942 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-03-08 04:42:50,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:42:50,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-08 04:42:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:50,943 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:42:50,943 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 04:42:50,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:42:50,944 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:50,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 191 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 04:42:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-08 04:42:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:42:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-03-08 04:42:50,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 24 [2025-03-08 04:42:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-03-08 04:42:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:42:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-03-08 04:42:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:42:50,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:50,963 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:50,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:42:50,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -736479620, now seen corresponding path program 1 times [2025-03-08 04:42:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985802333] [2025-03-08 04:42:50,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:50,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:42:50,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:42:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:50,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:42:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985802333] [2025-03-08 04:42:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985802333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:42:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795230197] [2025-03-08 04:42:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:42:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:42:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:42:51,079 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:42:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:51,205 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2025-03-08 04:42:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:42:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-08 04:42:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:51,206 INFO L225 Difference]: With dead ends: 70 [2025-03-08 04:42:51,206 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 04:42:51,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:42:51,207 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:51,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 104 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 04:42:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-08 04:42:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:42:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2025-03-08 04:42:51,218 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 27 [2025-03-08 04:42:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:51,218 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2025-03-08 04:42:51,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:42:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2025-03-08 04:42:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:42:51,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:51,219 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:51,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 04:42:51,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -227215326, now seen corresponding path program 1 times [2025-03-08 04:42:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827544219] [2025-03-08 04:42:51,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:51,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 04:42:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:42:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:51,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:42:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827544219] [2025-03-08 04:42:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827544219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:42:51,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:42:51,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 04:42:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411393215] [2025-03-08 04:42:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:42:51,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:42:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:51,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:42:51,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:42:51,316 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:42:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:51,399 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-08 04:42:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:42:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-08 04:42:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:51,401 INFO L225 Difference]: With dead ends: 72 [2025-03-08 04:42:51,401 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 04:42:51,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:42:51,402 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:51,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 132 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:42:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 04:42:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-08 04:42:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:42:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-03-08 04:42:51,410 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 29 [2025-03-08 04:42:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:51,410 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-03-08 04:42:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 04:42:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-03-08 04:42:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 04:42:51,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:51,411 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:51,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:42:51,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:51,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:51,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1804602413, now seen corresponding path program 1 times [2025-03-08 04:42:51,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:51,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214061190] [2025-03-08 04:42:51,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:51,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 04:42:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 04:42:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 04:42:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214061190] [2025-03-08 04:42:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214061190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:42:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083062739] [2025-03-08 04:42:51,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:42:51,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:42:51,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:42:51,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 04:42:51,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 04:42:51,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:51,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:51,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:42:51,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:42:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:42:51,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:42:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:42:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083062739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:42:52,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:42:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2025-03-08 04:42:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428273379] [2025-03-08 04:42:52,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:42:52,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:42:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:52,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:42:52,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:42:52,044 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 19 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-08 04:42:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:52,358 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2025-03-08 04:42:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:42:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 52 [2025-03-08 04:42:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:52,364 INFO L225 Difference]: With dead ends: 102 [2025-03-08 04:42:52,364 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 04:42:52,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-08 04:42:52,365 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:52,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 211 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:42:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 04:42:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 04:42:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 04:42:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-03-08 04:42:52,380 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 52 [2025-03-08 04:42:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:52,380 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-03-08 04:42:52,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-08 04:42:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-03-08 04:42:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 04:42:52,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:52,381 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:52,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:42:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:52,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2083773037, now seen corresponding path program 1 times [2025-03-08 04:42:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722423766] [2025-03-08 04:42:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:52,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 04:42:52,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 04:42:52,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:52,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 04:42:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722423766] [2025-03-08 04:42:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722423766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:42:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713753442] [2025-03-08 04:42:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:42:52,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:52,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:42:52,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:42:52,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:42:52,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 04:42:52,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 04:42:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:42:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:52,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 04:42:52,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:42:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 04:42:52,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:42:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 04:42:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713753442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:42:52,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:42:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 04:42:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088914770] [2025-03-08 04:42:52,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:42:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:42:52,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:52,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:42:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:42:52,995 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-08 04:42:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:53,084 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2025-03-08 04:42:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:42:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 54 [2025-03-08 04:42:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:53,086 INFO L225 Difference]: With dead ends: 93 [2025-03-08 04:42:53,086 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 04:42:53,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:42:53,087 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:53,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 04:42:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 04:42:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.087719298245614) internal successors, (62), 60 states have internal predecessors, (62), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 04:42:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-03-08 04:42:53,103 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 54 [2025-03-08 04:42:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:53,103 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-03-08 04:42:53,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-08 04:42:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-03-08 04:42:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 04:42:53,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:53,106 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:53,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:42:53,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 04:42:53,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1457473858, now seen corresponding path program 2 times [2025-03-08 04:42:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429713493] [2025-03-08 04:42:53,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:42:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:53,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-08 04:42:53,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 04:42:53,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:42:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-08 04:42:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429713493] [2025-03-08 04:42:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429713493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:42:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694581347] [2025-03-08 04:42:53,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:42:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:42:53,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:42:53,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:42:53,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-08 04:42:53,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 04:42:53,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:42:53,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:53,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:42:53,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:42:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:42:53,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:42:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:42:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694581347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:42:53,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:42:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2025-03-08 04:42:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766134627] [2025-03-08 04:42:53,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:42:53,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 04:42:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:53,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 04:42:53,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:42:53,887 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 22 states, 20 states have (on average 3.0) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-08 04:42:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:54,216 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2025-03-08 04:42:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:42:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 79 [2025-03-08 04:42:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:54,217 INFO L225 Difference]: With dead ends: 102 [2025-03-08 04:42:54,217 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 04:42:54,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 04:42:54,218 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:54,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 195 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 04:42:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2025-03-08 04:42:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 04:42:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-03-08 04:42:54,228 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 79 [2025-03-08 04:42:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:54,228 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-03-08 04:42:54,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.0) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2025-03-08 04:42:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2025-03-08 04:42:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 04:42:54,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:42:54,230 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:54,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:42:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:54,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:42:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:42:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1370720499, now seen corresponding path program 2 times [2025-03-08 04:42:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:42:54,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232898876] [2025-03-08 04:42:54,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:42:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:42:54,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-08 04:42:54,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 04:42:54,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:42:54,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 56 proven. 49 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 04:42:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:42:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232898876] [2025-03-08 04:42:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232898876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:42:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739269201] [2025-03-08 04:42:54,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:42:54,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:42:54,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:42:54,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:42:54,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-03-08 04:42:54,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 04:42:54,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:42:54,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:42:54,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:42:54,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:42:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 64 proven. 69 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-08 04:42:54,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:42:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 71 proven. 62 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-08 04:42:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739269201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:42:55,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:42:55,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2025-03-08 04:42:55,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911570452] [2025-03-08 04:42:55,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:42:55,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 04:42:55,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:42:55,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 04:42:55,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 04:42:55,076 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-08 04:42:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:42:55,335 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2025-03-08 04:42:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:42:55,336 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) Word has length 102 [2025-03-08 04:42:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:42:55,336 INFO L225 Difference]: With dead ends: 106 [2025-03-08 04:42:55,336 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:42:55,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 195 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2025-03-08 04:42:55,337 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:42:55,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 333 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:42:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:42:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:42:55,338 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) [2025-03-08 04:42:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:42:55,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-03-08 04:42:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:42:55,338 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:42:55,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-08 04:42:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:42:55,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:42:55,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:42:55,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:42:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:42:55,547 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 04:42:55,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:42:56,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:42:56,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:42:56 BoogieIcfgContainer [2025-03-08 04:42:56,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:42:56,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:42:56,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:42:56,074 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:42:56,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:42:49" (3/4) ... [2025-03-08 04:42:56,075 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:42:56,079 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 04:42:56,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 04:42:56,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:42:56,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:42:56,083 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:42:56,139 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:42:56,139 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:42:56,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:42:56,140 INFO L158 Benchmark]: Toolchain (without parser) took 6588.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 124.0MB in the beginning and 128.8MB in the end (delta: -4.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2025-03-08 04:42:56,140 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:42:56,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.08ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 112.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:42:56,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.24ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:42:56,141 INFO L158 Benchmark]: Boogie Preprocessor took 23.85ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 907.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:42:56,141 INFO L158 Benchmark]: IcfgBuilder took 246.48ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:42:56,142 INFO L158 Benchmark]: TraceAbstraction took 6080.25ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 98.3MB in the beginning and 134.1MB in the end (delta: -35.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-08 04:42:56,142 INFO L158 Benchmark]: Witness Printer took 66.17ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 128.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:42:56,145 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.08ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 112.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.24ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.85ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.4MB in the end (delta: 907.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 246.48ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6080.25ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 98.3MB in the beginning and 134.1MB in the end (delta: -35.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 66.17ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 128.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 51 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 1599 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1057 IncrementalHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 298 mSDtfsCounter, 1057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 538 SyntacticMatches, 17 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=9, InterpolantAutomatonStates: 92, 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, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 960 ConstructedInterpolants, 0 QuantifiedInterpolants, 3111 SizeOfPredicates, 14 NumberOfNonLiveVariables, 618 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2594/2923 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((((((buf == 0) && (bufferlen == ((long long) 2 + buflim))) && (0 <= buflim)) && (((long long) 3 + buflim) <= inlen)) && (in == 0)) || ((((((((long long) bufferlen + in) + 1) <= ((long long) buf + inlen)) && (bufferlen == ((long long) 2 + buflim))) && (1 <= in)) && (buf <= buflim)) && (0 <= buf))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:42:56,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE