./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c --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/nla-digbench-scaling/cohencu-ll_unwindbound2.c -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 f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:54:14,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:54:14,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:54:14,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:54:14,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:54:14,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:54:14,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:54:14,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:54:14,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:54:14,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:54:14,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:54:14,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:54:14,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:54:14,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:54:14,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:54:14,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:14,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:54:14,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:54:14,233 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2025-03-08 04:54:14,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:54:14,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:54:14,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:54:14,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:54:14,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:54:14,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-08 04:54:15,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18326071e/da29b102369d49e7b8cf5aae1f09a3d6/FLAG78ca1edff [2025-03-08 04:54:15,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:54:15,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-08 04:54:15,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18326071e/da29b102369d49e7b8cf5aae1f09a3d6/FLAG78ca1edff [2025-03-08 04:54:15,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18326071e/da29b102369d49e7b8cf5aae1f09a3d6 [2025-03-08 04:54:15,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:54:15,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:54:15,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:15,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:54:15,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:54:15,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:15,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15, skipping insertion in model container [2025-03-08 04:54:15,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:15,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:54:15,916 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/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2025-03-08 04:54:15,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:15,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:54:15,953 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/nla-digbench-scaling/cohencu-ll_unwindbound2.c[588,601] [2025-03-08 04:54:15,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:15,973 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:54:15,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15 WrapperNode [2025-03-08 04:54:15,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:15,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:15,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:54:15,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:54:15,980 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:54:15" (1/1) ... [2025-03-08 04:54:15,984 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:54:15" (1/1) ... [2025-03-08 04:54:15,992 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-03-08 04:54:15,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:15,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:54:15,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:54:15,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:54:15,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:15,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:15,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,008 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:54:16,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:54:16,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:54:16,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:54:16,012 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:54:16,013 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (1/1) ... [2025-03-08 04:54:16,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:16,033 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:54:16,038 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:54:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:54:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:54:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:54:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:54:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:54:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:54:16,092 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:54:16,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:54:16,204 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-08 04:54:16,204 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:54:16,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:54:16,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:54:16,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:16 BoogieIcfgContainer [2025-03-08 04:54:16,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:54:16,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:54:16,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:54:16,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:54:16,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:15" (1/3) ... [2025-03-08 04:54:16,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144d27bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:16, skipping insertion in model container [2025-03-08 04:54:16,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:15" (2/3) ... [2025-03-08 04:54:16,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144d27bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:16, skipping insertion in model container [2025-03-08 04:54:16,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:16" (3/3) ... [2025-03-08 04:54:16,223 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2025-03-08 04:54:16,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:54:16,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound2.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:54:16,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:54:16,286 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;@4e4f98c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:54:16,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:54:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 04:54:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:54:16,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:16,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:16,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:16,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1331043944, now seen corresponding path program 1 times [2025-03-08 04:54:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456458577] [2025-03-08 04:54:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:54:16,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:54:16,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:16,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:16,419 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:54:16,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456458577] [2025-03-08 04:54:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456458577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:16,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:16,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:54:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538887662] [2025-03-08 04:54:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:16,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:54:16,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:54:16,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:54:16,442 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:54:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:16,457 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2025-03-08 04:54:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:54:16,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-03-08 04:54:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:16,463 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:54:16,463 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:54:16,465 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:54:16,469 INFO L435 NwaCegarLoop]: 37 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, 37 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:54:16,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:54:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 04:54:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 04:54:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2025-03-08 04:54:16,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2025-03-08 04:54:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:16,499 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-03-08 04:54:16,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:54:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2025-03-08 04:54:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:54:16,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:16,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:54:16,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1736523449, now seen corresponding path program 1 times [2025-03-08 04:54:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-08 04:54:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:16,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:54:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:54:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:16,668 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:54:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-08 04:54:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56972468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:16,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433441623] [2025-03-08 04:54:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:16,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:16,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:16,675 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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:54:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:16,741 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-03-08 04:54:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-03-08 04:54:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:16,743 INFO L225 Difference]: With dead ends: 28 [2025-03-08 04:54:16,743 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 04:54:16,743 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:54:16,744 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:16,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 04:54:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 04:54:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 04:54:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-08 04:54:16,751 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 8 [2025-03-08 04:54:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:16,751 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-08 04:54:16,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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:54:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-03-08 04:54:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:54:16,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:16,752 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:16,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:54:16,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:16,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash 359075189, now seen corresponding path program 1 times [2025-03-08 04:54:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121031722] [2025-03-08 04:54:16,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:16,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:54:16,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:54:16,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:16,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707493997] [2025-03-08 04:54:16,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:16,776 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:54:16,778 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:54:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:54:16,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:54:16,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:16,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:16,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:16,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:16,887 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:54:16,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121031722] [2025-03-08 04:54:16,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707493997] [2025-03-08 04:54:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707493997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165301610] [2025-03-08 04:54:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:16,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:16,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:16,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:16,889 INFO L87 Difference]: Start difference. First operand 26 states and 36 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, (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:54:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:16,936 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2025-03-08 04:54:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:16,937 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, (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 13 [2025-03-08 04:54:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:16,938 INFO L225 Difference]: With dead ends: 46 [2025-03-08 04:54:16,938 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 04:54:16,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:54:16,939 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:16,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 04:54:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2025-03-08 04:54:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 04:54:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-08 04:54:16,951 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 13 [2025-03-08 04:54:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:16,951 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-08 04:54:16,951 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, (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:54:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-08 04:54:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:54:16,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:16,951 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:16,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:54:17,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:17,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1047704010, now seen corresponding path program 1 times [2025-03-08 04:54:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-03-08 04:54:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:17,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:54:17,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:54:17,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:17,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:17,200 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:54:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-03-08 04:54:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340143135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:17,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:17,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:54:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957468919] [2025-03-08 04:54:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:17,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:54:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:17,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:54:17,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:54:17,202 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:54:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:17,223 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-03-08 04:54:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:54:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2025-03-08 04:54:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:17,227 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:54:17,227 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:54:17,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:54:17,227 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:17,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:54:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 04:54:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 04:54:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 04:54:17,236 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2025-03-08 04:54:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:17,236 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 04:54:17,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:54:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 04:54:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:54:17,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:17,237 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:17,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:54:17,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1747981895, now seen corresponding path program 1 times [2025-03-08 04:54:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939680959] [2025-03-08 04:54:17,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:17,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:17,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:54:17,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:54:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:17,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079968037] [2025-03-08 04:54:17,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:17,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:17,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:17,255 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:54:17,255 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:54:17,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:54:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:54:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:17,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:17,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:17,346 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:54:17,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939680959] [2025-03-08 04:54:17,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079968037] [2025-03-08 04:54:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079968037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915758643] [2025-03-08 04:54:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:17,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:17,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:17,350 INFO L87 Difference]: Start difference. First operand 34 states and 45 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, (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:54:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:17,406 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2025-03-08 04:54:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:17,406 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, (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 18 [2025-03-08 04:54:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:17,407 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:54:17,407 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 04:54:17,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:54:17,408 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:17,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 04:54:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-08 04:54:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 04:54:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-03-08 04:54:17,422 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2025-03-08 04:54:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:17,422 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-03-08 04:54:17,422 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, (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:54:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-03-08 04:54:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:54:17,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:17,423 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:17,430 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:54:17,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:17,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2013833461, now seen corresponding path program 1 times [2025-03-08 04:54:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586297911] [2025-03-08 04:54:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:17,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773609678] [2025-03-08 04:54:17,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:17,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:17,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:17,651 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:54:17,652 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:54:17,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:17,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:17,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:17,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:17,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 04:54:17,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:17,779 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:54:17,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586297911] [2025-03-08 04:54:17,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773609678] [2025-03-08 04:54:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773609678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216678842] [2025-03-08 04:54:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:17,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:17,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:17,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:17,781 INFO L87 Difference]: Start difference. First operand 44 states and 60 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:54:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:17,840 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-08 04:54:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:17,841 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-08 04:54:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:17,841 INFO L225 Difference]: With dead ends: 58 [2025-03-08 04:54:17,841 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 04:54:17,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:54:17,842 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:17,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 04:54:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 04:54:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:54:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-08 04:54:17,850 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2025-03-08 04:54:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:17,850 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-08 04:54:17,850 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 04:54:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-08 04:54:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:54:17,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:17,851 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:17,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:18,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:18,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2015639435, now seen corresponding path program 1 times [2025-03-08 04:54:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-08 04:54:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:18,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:54:18,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:54:18,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:18,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885388720] [2025-03-08 04:54:18,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:18,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:18,082 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:54:18,083 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:54:18,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:54:18,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:54:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:18,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:54:18,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:54:18,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:54:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642433854] [2025-03-08 04:54:18,377 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885388720] [2025-03-08 04:54:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885388720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:18,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-08 04:54:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582642805] [2025-03-08 04:54:18,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:18,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:54:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:54:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:54:18,379 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 04:54:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:18,596 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2025-03-08 04:54:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:54:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 41 [2025-03-08 04:54:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:18,599 INFO L225 Difference]: With dead ends: 70 [2025-03-08 04:54:18,599 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 04:54:18,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:54:18,600 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:18,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 164 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:54:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 04:54:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-08 04:54:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:54:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-08 04:54:18,619 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 41 [2025-03-08 04:54:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:18,619 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-08 04:54:18,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 04:54:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-08 04:54:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:54:18,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:18,620 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:18,626 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:54:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:18,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:18,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1590699040, now seen corresponding path program 1 times [2025-03-08 04:54:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453670183] [2025-03-08 04:54:18,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:18,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:54:18,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:54:18,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:18,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 04:54:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:18,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453670183] [2025-03-08 04:54:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453670183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:54:18,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295130689] [2025-03-08 04:54:18,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:18,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:18,923 INFO L229 MonitoredProcess]: Starting monitored process 6 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:54:18,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:54:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:54:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:54:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:18,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:54:18,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 04:54:19,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 04:54:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295130689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:19,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:54:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2025-03-08 04:54:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944710933] [2025-03-08 04:54:19,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:19,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:54:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:19,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:54:19,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:54:19,079 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 04:54:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:19,115 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2025-03-08 04:54:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:54:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 41 [2025-03-08 04:54:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:19,116 INFO L225 Difference]: With dead ends: 80 [2025-03-08 04:54:19,116 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 04:54:19,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:54:19,117 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 04:54:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-08 04:54:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 04:54:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2025-03-08 04:54:19,127 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 41 [2025-03-08 04:54:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:19,127 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2025-03-08 04:54:19,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 04:54:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2025-03-08 04:54:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 04:54:19,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:19,128 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:19,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:19,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:19,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:19,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:19,329 INFO L85 PathProgramCache]: Analyzing trace with hash 78105073, now seen corresponding path program 2 times [2025-03-08 04:54:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449417389] [2025-03-08 04:54:19,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:19,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 04:54:19,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 04:54:19,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:19,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:19,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418223768] [2025-03-08 04:54:19,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:19,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:19,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:19,356 INFO L229 MonitoredProcess]: Starting monitored process 7 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:54:19,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:54:19,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 04:54:19,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 04:54:19,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:19,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:19,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:54:19,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:54:19,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 04:54:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449417389] [2025-03-08 04:54:19,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418223768] [2025-03-08 04:54:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418223768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:19,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-08 04:54:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098093403] [2025-03-08 04:54:19,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:54:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:54:19,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:54:19,643 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 04:54:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:19,885 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2025-03-08 04:54:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:54:19,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2025-03-08 04:54:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:19,887 INFO L225 Difference]: With dead ends: 90 [2025-03-08 04:54:19,888 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 04:54:19,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:54:19,890 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:19,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:54:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 04:54:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-03-08 04:54:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 47 states have internal predecessors, (49), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 04:54:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2025-03-08 04:54:19,921 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 46 [2025-03-08 04:54:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:19,921 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-03-08 04:54:19,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 04:54:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2025-03-08 04:54:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 04:54:19,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:19,926 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:19,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:20,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:20,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:20,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1836391767, now seen corresponding path program 1 times [2025-03-08 04:54:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329458777] [2025-03-08 04:54:20,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:20,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:54:20,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:54:20,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104631882] [2025-03-08 04:54:20,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:20,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:20,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:20,157 INFO L229 MonitoredProcess]: Starting monitored process 8 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:54:20,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:54:20,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 04:54:20,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 04:54:20,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:20,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:20,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:54:20,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:54:20,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 04:54:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329458777] [2025-03-08 04:54:20,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104631882] [2025-03-08 04:54:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104631882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:20,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:54:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 04:54:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331140411] [2025-03-08 04:54:20,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:54:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:20,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:54:20,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:54:20,495 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 04:54:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:20,720 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2025-03-08 04:54:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:54:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2025-03-08 04:54:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:20,724 INFO L225 Difference]: With dead ends: 111 [2025-03-08 04:54:20,724 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 04:54:20,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:54:20,724 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:20,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 238 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:54:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 04:54:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-03-08 04:54:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 04:54:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2025-03-08 04:54:20,767 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 67 [2025-03-08 04:54:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:20,767 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2025-03-08 04:54:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-08 04:54:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2025-03-08 04:54:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 04:54:20,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:20,768 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:20,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:20,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:20,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1590143222, now seen corresponding path program 2 times [2025-03-08 04:54:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612042417] [2025-03-08 04:54:20,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:20,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 04:54:20,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 04:54:20,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:20,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031110834] [2025-03-08 04:54:20,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:54:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:20,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:20,992 INFO L229 MonitoredProcess]: Starting monitored process 9 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:54:20,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 04:54:21,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 04:54:21,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 04:54:21,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:54:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:54:21,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 04:54:21,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 04:54:21,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 04:54:21,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:21,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:54:21,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 04:54:21,066 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 04:54:21,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:54:21,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 04:54:21,271 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:21,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:54:21,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:54:21 BoogieIcfgContainer [2025-03-08 04:54:21,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:54:21,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:54:21,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:54:21,302 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:54:21,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:16" (3/4) ... [2025-03-08 04:54:21,303 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 04:54:21,334 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-03-08 04:54:21,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:54:21,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:54:21,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:54:21,383 INFO L158 Benchmark]: Toolchain (without parser) took 5582.84ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 141.8MB in the end (delta: 13.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2025-03-08 04:54:21,383 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:21,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.82ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 143.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:54:21,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.50ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:21,383 INFO L158 Benchmark]: Boogie Preprocessor took 18.65ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 141.3MB in the end (delta: 819.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:21,384 INFO L158 Benchmark]: IcfgBuilder took 201.67ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 128.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:54:21,384 INFO L158 Benchmark]: TraceAbstraction took 5085.29ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 150.2MB in the end (delta: -22.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:21,384 INFO L158 Benchmark]: Witness Printer took 80.73ms. Allocated memory is still 201.3MB. Free memory was 150.2MB in the beginning and 141.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:54:21,385 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.19ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.82ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 143.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.50ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.65ms. Allocated memory is still 201.3MB. Free memory was 142.1MB in the beginning and 141.3MB in the end (delta: 819.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 201.67ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 128.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5085.29ms. Allocated memory is still 201.3MB. Free memory was 128.0MB in the beginning and 150.2MB in the end (delta: -22.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 80.73ms. Allocated memory is still 201.3MB. Free memory was 150.2MB in the beginning and 141.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=2, counter=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L33] EXPR counter++ VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=2, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=2, counter=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L33] EXPR counter++ VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=2, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=2, counter=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<2 [L33] EXPR counter++ VAL [a=2, counter=3, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 50 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 905 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 656 IncrementalHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 329 mSDtfsCounter, 656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 2066 SizeOfPredicates, 11 NumberOfNonLiveVariables, 710 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 1033/1110 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 04:54:21,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE