./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/hardware-verification-bv/btor2c-lazyMod.cal55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:09:18,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:09:18,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:09:18,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:09:18,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:09:18,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:09:18,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:09:18,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:09:18,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:09:18,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:09:18,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:09:18,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:09:18,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:09:18,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:09:18,228 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:09:18,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:09:18,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:09:18,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:18,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:09:18,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:09:18,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:09:18,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:09:18,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:09:18,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:09:18,231 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 [2025-03-03 17:09:18,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:09:18,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:09:18,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:09:18,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:09:18,456 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:09:18,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-03-03 17:09:19,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0733b02a/c04999953b1b4e5cbdd26f871bf3311b/FLAGd5311845f [2025-03-03 17:09:19,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:09:19,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-03-03 17:09:19,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0733b02a/c04999953b1b4e5cbdd26f871bf3311b/FLAGd5311845f [2025-03-03 17:09:19,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0733b02a/c04999953b1b4e5cbdd26f871bf3311b [2025-03-03 17:09:19,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:09:19,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:09:19,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:19,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:09:19,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:09:19,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:19" (1/1) ... [2025-03-03 17:09:19,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cca8630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:19, skipping insertion in model container [2025-03-03 17:09:19,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:19" (1/1) ... [2025-03-03 17:09:19,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:09:20,051 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/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-03-03 17:09:20,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:20,101 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:09:20,108 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/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-03-03 17:09:20,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:20,145 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:09:20,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20 WrapperNode [2025-03-03 17:09:20,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:20,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:20,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:09:20,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:09:20,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,202 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 347 [2025-03-03 17:09:20,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:20,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:09:20,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:09:20,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:09:20,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,229 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:09:20,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:09:20,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:09:20,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:09:20,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:09:20,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (1/1) ... [2025-03-03 17:09:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:20,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:20,308 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-03 17:09:20,319 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-03 17:09:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:09:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:09:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:09:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:09:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:09:20,414 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:09:20,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:09:20,864 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-03 17:09:20,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:09:20,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:09:20,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:09:20,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:20 BoogieIcfgContainer [2025-03-03 17:09:20,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:09:20,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:09:20,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:09:20,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:09:20,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:09:19" (1/3) ... [2025-03-03 17:09:20,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3db3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:20, skipping insertion in model container [2025-03-03 17:09:20,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:20" (2/3) ... [2025-03-03 17:09:20,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3db3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:20, skipping insertion in model container [2025-03-03 17:09:20,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:20" (3/3) ... [2025-03-03 17:09:20,901 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal55.c [2025-03-03 17:09:20,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:09:20,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal55.c that has 1 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:09:20,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:09:20,966 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;@5e9fddfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:09:20,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:09:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:09:20,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:20,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:20,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1379983778, now seen corresponding path program 1 times [2025-03-03 17:09:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96090563] [2025-03-03 17:09:20,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:21,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:09:21,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:09:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:21,501 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-03 17:09:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96090563] [2025-03-03 17:09:21,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96090563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:21,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394469949] [2025-03-03 17:09:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:21,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:21,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:21,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:21,518 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:21,599 INFO L93 Difference]: Finished difference Result 145 states and 213 transitions. [2025-03-03 17:09:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 17:09:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:21,606 INFO L225 Difference]: With dead ends: 145 [2025-03-03 17:09:21,606 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 17:09:21,609 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-03 17:09:21,612 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:21,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 17:09:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 17:09:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2025-03-03 17:09:21,637 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 35 [2025-03-03 17:09:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2025-03-03 17:09:21,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2025-03-03 17:09:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:09:21,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:21,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:09:21,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash -165496676, now seen corresponding path program 1 times [2025-03-03 17:09:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144387940] [2025-03-03 17:09:21,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:21,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:09:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:09:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:21,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:21,824 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-03 17:09:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144387940] [2025-03-03 17:09:21,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144387940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:21,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:21,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034911865] [2025-03-03 17:09:21,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:21,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:21,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:21,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:21,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:21,828 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:21,898 INFO L93 Difference]: Finished difference Result 146 states and 211 transitions. [2025-03-03 17:09:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 17:09:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:21,899 INFO L225 Difference]: With dead ends: 146 [2025-03-03 17:09:21,899 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 17:09:21,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 17:09:21,899 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:21,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 17:09:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 17:09:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2025-03-03 17:09:21,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 36 [2025-03-03 17:09:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:21,908 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2025-03-03 17:09:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2025-03-03 17:09:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:09:21,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:21,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:21,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:09:21,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:21,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1096079581, now seen corresponding path program 1 times [2025-03-03 17:09:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015762460] [2025-03-03 17:09:21,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:21,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:09:21,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:09:21,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:21,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:22,202 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-03 17:09:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015762460] [2025-03-03 17:09:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015762460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:09:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253045006] [2025-03-03 17:09:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:09:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:22,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:09:22,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:22,203 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:22,330 INFO L93 Difference]: Finished difference Result 201 states and 287 transitions. [2025-03-03 17:09:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:09:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:09:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:22,332 INFO L225 Difference]: With dead ends: 201 [2025-03-03 17:09:22,332 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 17:09:22,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:09:22,333 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 267 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:22,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 353 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 17:09:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2025-03-03 17:09:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.456896551724138) internal successors, (169), 116 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-03-03 17:09:22,341 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 37 [2025-03-03 17:09:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:22,341 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-03-03 17:09:22,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-03-03 17:09:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:09:22,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:22,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:09:22,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1507091169, now seen corresponding path program 1 times [2025-03-03 17:09:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638017346] [2025-03-03 17:09:22,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:09:22,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:09:22,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:22,565 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-03 17:09:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638017346] [2025-03-03 17:09:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638017346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 17:09:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110294168] [2025-03-03 17:09:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 17:09:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:22,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 17:09:22,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 17:09:22,567 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:22,603 INFO L93 Difference]: Finished difference Result 200 states and 288 transitions. [2025-03-03 17:09:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 17:09:22,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 17:09:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:22,604 INFO L225 Difference]: With dead ends: 200 [2025-03-03 17:09:22,604 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 17:09:22,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 17:09:22,605 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:22,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 184 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 17:09:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 17:09:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2025-03-03 17:09:22,612 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 38 [2025-03-03 17:09:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:22,613 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2025-03-03 17:09:22,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2025-03-03 17:09:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:09:22,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:22,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:09:22,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2107077500, now seen corresponding path program 1 times [2025-03-03 17:09:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376029150] [2025-03-03 17:09:22,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:22,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:09:22,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:09:22,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:22,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:22,901 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-03 17:09:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:22,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376029150] [2025-03-03 17:09:22,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376029150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:22,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:22,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:09:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597080079] [2025-03-03 17:09:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:09:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:09:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:09:22,905 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:23,075 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2025-03-03 17:09:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:09:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 17:09:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:23,076 INFO L225 Difference]: With dead ends: 203 [2025-03-03 17:09:23,077 INFO L226 Difference]: Without dead ends: 138 [2025-03-03 17:09:23,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:09:23,077 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 265 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:23,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 512 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-03 17:09:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2025-03-03 17:09:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2025-03-03 17:09:23,087 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 39 [2025-03-03 17:09:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:23,088 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2025-03-03 17:09:23,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2025-03-03 17:09:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:09:23,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:23,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:09:23,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:23,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 740296333, now seen corresponding path program 1 times [2025-03-03 17:09:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682844660] [2025-03-03 17:09:23,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:09:23,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:09:23,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:23,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:23,298 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-03 17:09:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682844660] [2025-03-03 17:09:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682844660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:23,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:09:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717479939] [2025-03-03 17:09:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:23,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:09:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:23,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:09:23,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:23,304 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:23,392 INFO L93 Difference]: Finished difference Result 210 states and 299 transitions. [2025-03-03 17:09:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:09:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-03 17:09:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:23,394 INFO L225 Difference]: With dead ends: 210 [2025-03-03 17:09:23,394 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 17:09:23,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:23,395 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 101 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:23,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 322 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 17:09:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-03-03 17:09:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2025-03-03 17:09:23,403 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 40 [2025-03-03 17:09:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:23,403 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2025-03-03 17:09:23,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2025-03-03 17:09:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 17:09:23,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:23,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:23,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:09:23,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:23,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1933893170, now seen corresponding path program 1 times [2025-03-03 17:09:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:23,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450945792] [2025-03-03 17:09:23,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:23,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 17:09:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 17:09:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:23,590 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-03 17:09:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450945792] [2025-03-03 17:09:23,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450945792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:23,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:23,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:09:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582750180] [2025-03-03 17:09:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:09:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:23,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:09:23,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:23,592 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:23,650 INFO L93 Difference]: Finished difference Result 222 states and 311 transitions. [2025-03-03 17:09:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:09:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 17:09:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:23,651 INFO L225 Difference]: With dead ends: 222 [2025-03-03 17:09:23,651 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 17:09:23,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:23,652 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 101 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:23,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 271 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 17:09:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-03 17:09:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 131 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 183 transitions. [2025-03-03 17:09:23,663 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 183 transitions. Word has length 41 [2025-03-03 17:09:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:23,663 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 183 transitions. [2025-03-03 17:09:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 183 transitions. [2025-03-03 17:09:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:09:23,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:23,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:23,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:09:23,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1749297894, now seen corresponding path program 1 times [2025-03-03 17:09:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97122140] [2025-03-03 17:09:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:23,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:09:23,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:09:23,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:23,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:23,942 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-03 17:09:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97122140] [2025-03-03 17:09:23,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97122140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:23,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:09:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994805704] [2025-03-03 17:09:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:09:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:23,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:09:23,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:23,943 INFO L87 Difference]: Start difference. First operand 132 states and 183 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:24,020 INFO L93 Difference]: Finished difference Result 236 states and 325 transitions. [2025-03-03 17:09:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:09:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 17:09:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:24,022 INFO L225 Difference]: With dead ends: 236 [2025-03-03 17:09:24,022 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 17:09:24,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:09:24,023 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 122 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:24,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 360 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 17:09:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2025-03-03 17:09:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 151 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2025-03-03 17:09:24,028 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 42 [2025-03-03 17:09:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:24,028 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2025-03-03 17:09:24,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2025-03-03 17:09:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:09:24,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:24,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:09:24,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:24,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1335158228, now seen corresponding path program 1 times [2025-03-03 17:09:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713907471] [2025-03-03 17:09:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:24,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:09:24,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:09:24,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:24,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:24,235 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-03 17:09:24,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713907471] [2025-03-03 17:09:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713907471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:09:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430980951] [2025-03-03 17:09:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:09:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:24,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:09:24,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:24,236 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:24,319 INFO L93 Difference]: Finished difference Result 261 states and 356 transitions. [2025-03-03 17:09:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:09:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-03 17:09:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:24,321 INFO L225 Difference]: With dead ends: 261 [2025-03-03 17:09:24,321 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 17:09:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:24,321 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 97 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:24,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 229 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 17:09:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-03 17:09:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.356687898089172) internal successors, (213), 157 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 213 transitions. [2025-03-03 17:09:24,325 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 213 transitions. Word has length 42 [2025-03-03 17:09:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:24,325 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 213 transitions. [2025-03-03 17:09:24,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 213 transitions. [2025-03-03 17:09:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 17:09:24,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:24,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:24,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:09:24,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 265126536, now seen corresponding path program 1 times [2025-03-03 17:09:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:24,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549926663] [2025-03-03 17:09:24,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:24,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 17:09:24,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 17:09:24,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:24,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:24,620 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-03 17:09:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:24,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549926663] [2025-03-03 17:09:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549926663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:24,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:09:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985030224] [2025-03-03 17:09:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:24,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:09:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:24,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:09:24,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:09:24,622 INFO L87 Difference]: Start difference. First operand 158 states and 213 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:24,825 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2025-03-03 17:09:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:09:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-03 17:09:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:24,826 INFO L225 Difference]: With dead ends: 260 [2025-03-03 17:09:24,826 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 17:09:24,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:09:24,827 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:24,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 579 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 17:09:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2025-03-03 17:09:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.3540372670807452) internal successors, (218), 161 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2025-03-03 17:09:24,830 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 43 [2025-03-03 17:09:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:24,831 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2025-03-03 17:09:24,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2025-03-03 17:09:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:09:24,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:24,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:24,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:09:24,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1451510050, now seen corresponding path program 1 times [2025-03-03 17:09:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91809586] [2025-03-03 17:09:24,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:09:24,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:09:24,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:24,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:25,062 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-03 17:09:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91809586] [2025-03-03 17:09:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91809586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:25,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:09:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585052815] [2025-03-03 17:09:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:25,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:09:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:25,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:09:25,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:09:25,064 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:25,226 INFO L93 Difference]: Finished difference Result 267 states and 360 transitions. [2025-03-03 17:09:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:09:25,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 17:09:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:25,227 INFO L225 Difference]: With dead ends: 267 [2025-03-03 17:09:25,227 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 17:09:25,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:09:25,228 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 132 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:25,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 495 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 17:09:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2025-03-03 17:09:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 167 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2025-03-03 17:09:25,232 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 44 [2025-03-03 17:09:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:25,232 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2025-03-03 17:09:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2025-03-03 17:09:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:09:25,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:25,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:09:25,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1749467490, now seen corresponding path program 1 times [2025-03-03 17:09:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434834718] [2025-03-03 17:09:25,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:09:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:09:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:25,389 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-03 17:09:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:25,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434834718] [2025-03-03 17:09:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434834718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:25,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:09:25,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694581297] [2025-03-03 17:09:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:09:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:25,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:09:25,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:25,390 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:25,466 INFO L93 Difference]: Finished difference Result 268 states and 360 transitions. [2025-03-03 17:09:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:09:25,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 17:09:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:25,467 INFO L225 Difference]: With dead ends: 268 [2025-03-03 17:09:25,467 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 17:09:25,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:25,468 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:25,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 421 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 17:09:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-03 17:09:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.341317365269461) internal successors, (224), 167 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 224 transitions. [2025-03-03 17:09:25,471 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 224 transitions. Word has length 44 [2025-03-03 17:09:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:25,472 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 224 transitions. [2025-03-03 17:09:25,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 224 transitions. [2025-03-03 17:09:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:09:25,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:25,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:25,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:09:25,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:25,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1809181755, now seen corresponding path program 1 times [2025-03-03 17:09:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:25,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200895413] [2025-03-03 17:09:25,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:25,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:09:25,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:09:25,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:25,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:25,547 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-03 17:09:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200895413] [2025-03-03 17:09:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200895413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:09:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097271658] [2025-03-03 17:09:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:25,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:09:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:09:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:25,549 INFO L87 Difference]: Start difference. First operand 168 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:25,623 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2025-03-03 17:09:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:09:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 17:09:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:25,626 INFO L225 Difference]: With dead ends: 270 [2025-03-03 17:09:25,626 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 17:09:25,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:25,627 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:25,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 17:09:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-03 17:09:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 173 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2025-03-03 17:09:25,634 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 45 [2025-03-03 17:09:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2025-03-03 17:09:25,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2025-03-03 17:09:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:09:25,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:25,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:09:25,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1219767267, now seen corresponding path program 1 times [2025-03-03 17:09:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856868290] [2025-03-03 17:09:25,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:25,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:09:25,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:09:25,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:25,826 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-03 17:09:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856868290] [2025-03-03 17:09:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856868290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:25,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:09:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834858578] [2025-03-03 17:09:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:25,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:09:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:25,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:09:25,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:25,827 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:25,878 INFO L93 Difference]: Finished difference Result 290 states and 386 transitions. [2025-03-03 17:09:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:09:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 17:09:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:25,879 INFO L225 Difference]: With dead ends: 290 [2025-03-03 17:09:25,879 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 17:09:25,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:09:25,881 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 91 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:25,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 267 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 17:09:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-03 17:09:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.318918918918919) internal successors, (244), 185 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2025-03-03 17:09:25,887 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 45 [2025-03-03 17:09:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2025-03-03 17:09:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2025-03-03 17:09:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:09:25,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:25,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:25,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:09:25,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:25,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1364986884, now seen corresponding path program 1 times [2025-03-03 17:09:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442421542] [2025-03-03 17:09:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:25,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:09:25,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:09:25,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:26,041 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-03 17:09:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442421542] [2025-03-03 17:09:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442421542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:09:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565272639] [2025-03-03 17:09:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:26,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:09:26,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:09:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:26,043 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:26,137 INFO L93 Difference]: Finished difference Result 321 states and 419 transitions. [2025-03-03 17:09:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:09:26,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 17:09:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:26,139 INFO L225 Difference]: With dead ends: 321 [2025-03-03 17:09:26,139 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 17:09:26,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:26,139 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:26,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 405 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 17:09:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 172. [2025-03-03 17:09:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2025-03-03 17:09:26,143 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 45 [2025-03-03 17:09:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:26,144 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2025-03-03 17:09:26,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2025-03-03 17:09:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:09:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:26,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:26,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:09:26,144 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 333489163, now seen corresponding path program 1 times [2025-03-03 17:09:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431492545] [2025-03-03 17:09:26,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:26,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:09:26,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:09:26,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:26,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:26,462 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-03 17:09:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431492545] [2025-03-03 17:09:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431492545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:26,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:09:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067487976] [2025-03-03 17:09:26,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:09:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:09:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:26,465 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:26,662 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2025-03-03 17:09:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:09:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 17:09:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:26,663 INFO L225 Difference]: With dead ends: 278 [2025-03-03 17:09:26,663 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 17:09:26,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:09:26,664 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:26,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 392 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 17:09:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2025-03-03 17:09:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2025-03-03 17:09:26,672 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 45 [2025-03-03 17:09:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:26,672 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2025-03-03 17:09:26,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2025-03-03 17:09:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:09:26,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:26,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:26,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:09:26,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 160427494, now seen corresponding path program 1 times [2025-03-03 17:09:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997753981] [2025-03-03 17:09:26,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:26,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:09:26,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:09:26,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:26,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:09:26,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:09:26,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:09:26,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:09:26,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:26,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:09:26,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:09:26,743 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:09:26,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:09:26,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:09:26,747 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:26,773 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:09:26,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:09:26,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:09:26 BoogieIcfgContainer [2025-03-03 17:09:26,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:09:26,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:09:26,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:09:26,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:09:26,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:20" (3/4) ... [2025-03-03 17:09:26,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:09:26,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:09:26,788 INFO L158 Benchmark]: Toolchain (without parser) took 6864.13ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.6MB in the beginning and 174.6MB in the end (delta: -51.0MB). Peak memory consumption was 182.6MB. Max. memory is 16.1GB. [2025-03-03 17:09:26,788 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:26,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.71ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 108.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:09:26,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.69ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 100.8MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:26,789 INFO L158 Benchmark]: Boogie Preprocessor took 69.39ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 96.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:26,789 INFO L158 Benchmark]: IcfgBuilder took 619.22ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 49.4MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 17:09:26,789 INFO L158 Benchmark]: TraceAbstraction took 5889.54ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 48.8MB in the beginning and 174.7MB in the end (delta: -125.9MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2025-03-03 17:09:26,790 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 402.7MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:26,792 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.20ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.71ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 108.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.69ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 100.8MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.39ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 96.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 619.22ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 49.4MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5889.54ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 48.8MB in the beginning and 174.7MB in the end (delta: -125.9MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 402.7MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 81.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 117, overapproximation of bitwiseAnd at line 109, overapproximation of bitwiseAnd at line 122, overapproximation of bitwiseAnd at line 95. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 5; [L38] const SORT_5 var_23 = 4; [L39] const SORT_1 var_39 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L53] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_30_arg_1 = var_15; [L62] state_29 = init_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_39=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_21=5, var_23=4, var_39=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_24_arg_0 = var_20; [L85] SORT_5 var_24_arg_1 = var_23; [L86] SORT_1 var_24 = var_24_arg_0 == var_24_arg_1; [L87] SORT_1 var_25_arg_0 = var_24; [L88] SORT_1 var_25 = ~var_25_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_27_arg_0 = var_25; [L93] SORT_1 var_27_arg_1 = var_22; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_27_arg_0=-1, var_27_arg_1=0, var_39=1] [L94] EXPR ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_39=1] [L94] SORT_26 var_27 = ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1; [L95] EXPR var_27 & mask_SORT_26 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_39=1] [L95] var_27 = var_27 & mask_SORT_26 [L96] SORT_26 var_28_arg_0 = var_27; [L97] SORT_1 var_28 = var_28_arg_0 == mask_SORT_26; [L98] SORT_1 var_31_arg_0 = state_18; [L99] SORT_5 var_31_arg_1 = state_29; [L100] SORT_5 var_31_arg_2 = input_7; [L101] SORT_5 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_28=0, var_31=0, var_39=1] [L102] EXPR var_31 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_28=0, var_39=1] [L102] var_31 = var_31 & mask_SORT_5 [L103] SORT_5 var_32_arg_0 = var_31; [L104] SORT_5 var_32_arg_1 = var_21; [L105] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L106] SORT_1 var_33_arg_0 = var_25; [L107] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_33_arg_0=-1, var_33_arg_1=0, var_39=1] [L108] EXPR ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_39=1] [L108] SORT_26 var_33 = ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1; [L109] EXPR var_33 & mask_SORT_26 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_39=1] [L109] var_33 = var_33 & mask_SORT_26 [L110] SORT_26 var_34_arg_0 = var_33; [L111] SORT_1 var_34 = var_34_arg_0 == mask_SORT_26; [L112] SORT_1 var_35_arg_0 = var_28; [L113] SORT_1 var_35_arg_1 = var_34; [L114] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L115] SORT_1 var_36_arg_0 = var_14; [L116] SORT_1 var_36_arg_1 = var_35; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_36_arg_0=-1, var_36_arg_1=1, var_39=1] [L117] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L117] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L118] SORT_1 var_40_arg_0 = var_36; [L119] SORT_1 var_40 = ~var_40_arg_0; [L120] SORT_1 var_41_arg_0 = var_39; [L121] SORT_1 var_41_arg_1 = var_40; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-1] [L122] EXPR var_41_arg_0 & var_41_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L122] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L123] EXPR var_41 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L123] var_41 = var_41 & mask_SORT_1 [L124] SORT_1 bad_42_arg_0 = var_41; [L125] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1648 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1648 mSDsluCounter, 5595 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4193 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1890 IncrementalHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1402 mSDtfsCounter, 1890 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=14, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 115 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 645 ConstructedInterpolants, 0 QuantifiedInterpolants, 2312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:09:26,807 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.cal55.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:09:28,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:09:28,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:09:28,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:09:28,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:09:28,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:09:28,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:09:28,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:09:28,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:09:28,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:09:28,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:09:28,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:09:28,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:09:28,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:09:28,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:09:28,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:09:28,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:09:28,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:09:28,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:09:28,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:09:28,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:09:28,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:09:28,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:28,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:09:28,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:09:28,779 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 [2025-03-03 17:09:29,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:09:29,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:09:29,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:09:29,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:09:29,025 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:09:29,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-03-03 17:09:30,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943bc9e8d/8629180006204bc6acbf0de4e6bb610c/FLAGcc5649e1e [2025-03-03 17:09:30,407 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:09:30,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-03-03 17:09:30,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943bc9e8d/8629180006204bc6acbf0de4e6bb610c/FLAGcc5649e1e [2025-03-03 17:09:30,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943bc9e8d/8629180006204bc6acbf0de4e6bb610c [2025-03-03 17:09:30,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:09:30,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:09:30,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:30,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:09:30,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:09:30,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4e91bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30, skipping insertion in model container [2025-03-03 17:09:30,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:09:30,579 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/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-03-03 17:09:30,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:30,640 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:09:30,649 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/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-03-03 17:09:30,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:30,684 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:09:30,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30 WrapperNode [2025-03-03 17:09:30,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:30,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:30,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:09:30,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:09:30,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,725 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 203 [2025-03-03 17:09:30,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:30,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:09:30,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:09:30,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:09:30,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,751 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:09:30,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:09:30,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:09:30,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:09:30,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:09:30,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (1/1) ... [2025-03-03 17:09:30,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:30,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:30,808 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-03 17:09:30,810 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-03 17:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:09:30,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:09:30,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:09:30,913 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:09:30,914 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:09:31,127 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-03 17:09:31,127 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:09:31,135 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:09:31,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:09:31,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:31 BoogieIcfgContainer [2025-03-03 17:09:31,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:09:31,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:09:31,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:09:31,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:09:31,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:09:30" (1/3) ... [2025-03-03 17:09:31,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:31, skipping insertion in model container [2025-03-03 17:09:31,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:30" (2/3) ... [2025-03-03 17:09:31,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c00311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:31, skipping insertion in model container [2025-03-03 17:09:31,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:31" (3/3) ... [2025-03-03 17:09:31,144 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal55.c [2025-03-03 17:09:31,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:09:31,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal55.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:09:31,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:09:31,197 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;@69345108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:09:31,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:09:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:09:31,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:31,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:09:31,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:31,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:09:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1351588709] [2025-03-03 17:09:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:31,221 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-03 17:09:31,222 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-03 17:09:31,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:09:31,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:09:31,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:31,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:31,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:09:31,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:31,474 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-03 17:09:31,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:09:31,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:09:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351588709] [2025-03-03 17:09:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351588709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101132324] [2025-03-03 17:09:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:31,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:09:31,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:31,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:31,496 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:31,534 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:09:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:09:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:31,540 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:09:31,540 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:09:31,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:31,543 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:31,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:09:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:09:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:09:31,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:09:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:31,566 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:09:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:09:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:09:31,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:31,567 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:31,574 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-03 17:09:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:31,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:31,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:09:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72683457] [2025-03-03 17:09:31,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:31,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:31,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:31,771 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-03 17:09:31,772 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-03 17:09:31,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:09:31,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:09:31,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:31,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:31,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 17:09:31,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:09:32,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:09:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:09:38,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:09:38,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72683457] [2025-03-03 17:09:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72683457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:09:38,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:09:38,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:09:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064776295] [2025-03-03 17:09:38,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:09:38,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:09:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:09:38,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:09:38,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:09:38,620 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:38,712 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 17:09:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:09:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:09:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:38,712 INFO L225 Difference]: With dead ends: 14 [2025-03-03 17:09:38,713 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 17:09:38,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:09:38,713 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:38,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:38,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 17:09:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 17:09:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:09:38,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:09:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:38,715 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:09:38,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:09:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:09:38,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:38,716 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:09:38,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:09:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:38,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:38,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:09:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638060010] [2025-03-03 17:09:38,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:09:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:38,920 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-03 17:09:38,921 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-03 17:09:38,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:09:39,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:09:39,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:09:39,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:39,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-03 17:09:39,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:09:39,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:10:46,249 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 573 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)