./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.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.h_Spinner.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 c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:28,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:29,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:29,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:29,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:29,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:29,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:29,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:29,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:29,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:29,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:29,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:29,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:29,053 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:29,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:29,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:29,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:29,054 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2025-03-03 17:35:29,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:29,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:29,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:29,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:29,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:29,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:30,500 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28b00ab8/cf345dad68e2407a8a277591f5f079a3/FLAG96ef8b526 [2025-03-03 17:35:30,757 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:30,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:30,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28b00ab8/cf345dad68e2407a8a277591f5f079a3/FLAG96ef8b526 [2025-03-03 17:35:30,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28b00ab8/cf345dad68e2407a8a277591f5f079a3 [2025-03-03 17:35:30,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:30,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:30,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:30,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:30,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:30,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:30" (1/1) ... [2025-03-03 17:35:30,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d079fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:30, skipping insertion in model container [2025-03-03 17:35:30,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:30" (1/1) ... [2025-03-03 17:35:30,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:30,922 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.h_Spinner.c[1249,1262] [2025-03-03 17:35:31,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:31,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:31,031 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.h_Spinner.c[1249,1262] [2025-03-03 17:35:31,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:31,092 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:31,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31 WrapperNode [2025-03-03 17:35:31,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:31,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:31,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:31,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:31,098 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:35:31" (1/1) ... [2025-03-03 17:35:31,113 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:35:31" (1/1) ... [2025-03-03 17:35:31,177 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 589 [2025-03-03 17:35:31,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:31,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:31,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:31,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:31,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:31,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:31,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:31,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:31,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:31,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (1/1) ... [2025-03-03 17:35:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:31,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:31,298 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:35:31,301 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:35:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:31,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:31,414 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:31,416 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:32,116 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:32,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:32,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:32,158 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:32,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:32 BoogieIcfgContainer [2025-03-03 17:35:32,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:32,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:32,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:32,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:32,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:30" (1/3) ... [2025-03-03 17:35:32,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7af2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:32, skipping insertion in model container [2025-03-03 17:35:32,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:31" (2/3) ... [2025-03-03 17:35:32,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7af2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:32, skipping insertion in model container [2025-03-03 17:35:32,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:32" (3/3) ... [2025-03-03 17:35:32,165 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:32,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:32,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Spinner.c that has 1 procedures, 162 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:32,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:32,239 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;@7817c53d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:32,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:35:32,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:32,250 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:35:32,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash 972897395, now seen corresponding path program 1 times [2025-03-03 17:35:32,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:32,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426140907] [2025-03-03 17:35:32,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:35:32,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:35:32,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:32,868 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:35:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426140907] [2025-03-03 17:35:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426140907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:32,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881759989] [2025-03-03 17:35:32,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:32,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:32,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:32,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:32,893 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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:35:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:33,026 INFO L93 Difference]: Finished difference Result 309 states and 459 transitions. [2025-03-03 17:35:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:33,029 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:35:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:33,034 INFO L225 Difference]: With dead ends: 309 [2025-03-03 17:35:33,035 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 17:35:33,037 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:35:33,038 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:33,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 17:35:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-03 17:35:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.48125) internal successors, (237), 160 states have internal predecessors, (237), 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:35:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 237 transitions. [2025-03-03 17:35:33,069 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 237 transitions. Word has length 35 [2025-03-03 17:35:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:33,070 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 237 transitions. [2025-03-03 17:35:33,070 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:35:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 237 transitions. [2025-03-03 17:35:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:35:33,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:33,072 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:35:33,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:33,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:33,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 99727479, now seen corresponding path program 1 times [2025-03-03 17:35:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404695350] [2025-03-03 17:35:33,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:33,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:35:33,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:35:33,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:33,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:33,274 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:35:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404695350] [2025-03-03 17:35:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404695350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154979553] [2025-03-03 17:35:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:33,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:33,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:33,277 INFO L87 Difference]: Start difference. First operand 161 states and 237 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:35:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:33,382 INFO L93 Difference]: Finished difference Result 310 states and 457 transitions. [2025-03-03 17:35:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:33,383 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:35:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:33,384 INFO L225 Difference]: With dead ends: 310 [2025-03-03 17:35:33,384 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 17:35:33,384 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:35:33,385 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:33,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 17:35:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-03 17:35:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2025-03-03 17:35:33,391 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 36 [2025-03-03 17:35:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2025-03-03 17:35:33,392 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:35:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2025-03-03 17:35:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:35:33,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:33,392 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:35:33,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:33,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 728093934, now seen corresponding path program 1 times [2025-03-03 17:35:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861736134] [2025-03-03 17:35:33,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:33,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:35:33,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:35:33,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:33,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:34,119 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:35:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861736134] [2025-03-03 17:35:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861736134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:35:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347944939] [2025-03-03 17:35:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:35:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:35:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:34,122 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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:35:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:34,400 INFO L93 Difference]: Finished difference Result 356 states and 524 transitions. [2025-03-03 17:35:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:35:34,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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:35:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:34,402 INFO L225 Difference]: With dead ends: 356 [2025-03-03 17:35:34,403 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 17:35:34,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:34,404 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 54 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:34,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1493 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 17:35:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2025-03-03 17:35:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.4761904761904763) internal successors, (279), 189 states have internal predecessors, (279), 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:35:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 279 transitions. [2025-03-03 17:35:34,416 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 279 transitions. Word has length 37 [2025-03-03 17:35:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:34,416 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 279 transitions. [2025-03-03 17:35:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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:35:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 279 transitions. [2025-03-03 17:35:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:35:34,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:34,418 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:35:34,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:34,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1310529156, now seen corresponding path program 1 times [2025-03-03 17:35:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577328278] [2025-03-03 17:35:34,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:34,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:35:34,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:35:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:34,742 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:35:34,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:34,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577328278] [2025-03-03 17:35:34,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577328278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:34,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 17:35:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860734817] [2025-03-03 17:35:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 17:35:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:34,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 17:35:34,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 17:35:34,747 INFO L87 Difference]: Start difference. First operand 190 states and 279 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:35:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:34,818 INFO L93 Difference]: Finished difference Result 339 states and 498 transitions. [2025-03-03 17:35:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 17:35:34,819 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:35:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:34,820 INFO L225 Difference]: With dead ends: 339 [2025-03-03 17:35:34,820 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 17:35:34,821 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:35:34,821 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:34,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 383 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 17:35:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-03 17:35:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 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:35:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2025-03-03 17:35:34,828 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 38 [2025-03-03 17:35:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:34,828 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2025-03-03 17:35:34,828 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:35:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2025-03-03 17:35:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:35:34,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:34,832 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:35:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:35:34,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -122438236, now seen corresponding path program 1 times [2025-03-03 17:35:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292909693] [2025-03-03 17:35:34,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:35:34,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:35:34,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:34,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,128 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:35:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292909693] [2025-03-03 17:35:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292909693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653867579] [2025-03-03 17:35:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:35,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:35,130 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,280 INFO L93 Difference]: Finished difference Result 325 states and 475 transitions. [2025-03-03 17:35:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,281 INFO L225 Difference]: With dead ends: 325 [2025-03-03 17:35:35,281 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 17:35:35,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:35,282 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 12 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 933 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 17:35:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-03-03 17:35:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.464705882352941) internal successors, (249), 170 states have internal predecessors, (249), 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:35:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 249 transitions. [2025-03-03 17:35:35,286 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 249 transitions. Word has length 38 [2025-03-03 17:35:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,287 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 249 transitions. [2025-03-03 17:35:35,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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:35:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 249 transitions. [2025-03-03 17:35:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:35:35,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,288 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:35:35,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:35:35,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash -421542805, now seen corresponding path program 1 times [2025-03-03 17:35:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185661505] [2025-03-03 17:35:35,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:35:35,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:35:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:35,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,456 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:35:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185661505] [2025-03-03 17:35:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185661505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850403474] [2025-03-03 17:35:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:35,457 INFO L87 Difference]: Start difference. First operand 171 states and 249 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:35:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,548 INFO L93 Difference]: Finished difference Result 332 states and 484 transitions. [2025-03-03 17:35:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:35:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,549 INFO L225 Difference]: With dead ends: 332 [2025-03-03 17:35:35,549 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 17:35:35,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:35:35,551 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 209 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 572 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 17:35:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2025-03-03 17:35:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 173 states have internal predecessors, (252), 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:35:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2025-03-03 17:35:35,557 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 39 [2025-03-03 17:35:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,561 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2025-03-03 17:35:35,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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:35:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2025-03-03 17:35:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:35:35,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,561 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:35:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:35:35,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1826741369, now seen corresponding path program 1 times [2025-03-03 17:35:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2517247] [2025-03-03 17:35:35,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:35:35,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:35:35,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:35,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,899 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:35:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2517247] [2025-03-03 17:35:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2517247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229223182] [2025-03-03 17:35:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:35,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:35,901 INFO L87 Difference]: Start difference. First operand 174 states and 252 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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:35:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:36,142 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2025-03-03 17:35:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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:35:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:36,144 INFO L225 Difference]: With dead ends: 367 [2025-03-03 17:35:36,144 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 17:35:36,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:36,145 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 21 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:36,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1455 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 17:35:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2025-03-03 17:35:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 201 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2025-03-03 17:35:36,151 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 40 [2025-03-03 17:35:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2025-03-03 17:35:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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:35:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2025-03-03 17:35:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:35:36,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:36,155 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:35:36,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:35:36,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:36,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1705437599, now seen corresponding path program 1 times [2025-03-03 17:35:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316533577] [2025-03-03 17:35:36,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:36,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:35:36,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:35:36,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:36,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:36,834 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:35:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316533577] [2025-03-03 17:35:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316533577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:36,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:36,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 17:35:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41614342] [2025-03-03 17:35:36,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:36,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 17:35:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:36,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 17:35:36,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:35:36,837 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:35:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:37,339 INFO L93 Difference]: Finished difference Result 407 states and 585 transitions. [2025-03-03 17:35:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 17:35:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:35:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:37,341 INFO L225 Difference]: With dead ends: 407 [2025-03-03 17:35:37,342 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 17:35:37,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:35:37,343 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 54 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:37,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2102 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 17:35:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2025-03-03 17:35:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.4460093896713615) internal successors, (308), 213 states have internal predecessors, (308), 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:35:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 308 transitions. [2025-03-03 17:35:37,348 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 308 transitions. Word has length 40 [2025-03-03 17:35:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:37,349 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 308 transitions. [2025-03-03 17:35:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:35:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 308 transitions. [2025-03-03 17:35:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:35:37,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:37,350 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:35:37,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:35:37,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2077018484, now seen corresponding path program 1 times [2025-03-03 17:35:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565688119] [2025-03-03 17:35:37,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:37,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:35:37,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:35:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:37,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:37,740 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:35:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565688119] [2025-03-03 17:35:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565688119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:35:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672378387] [2025-03-03 17:35:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:35:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:37,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:35:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:37,742 INFO L87 Difference]: Start difference. First operand 214 states and 308 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:35:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:37,995 INFO L93 Difference]: Finished difference Result 419 states and 601 transitions. [2025-03-03 17:35:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:35:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:35:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:37,997 INFO L225 Difference]: With dead ends: 419 [2025-03-03 17:35:37,997 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 17:35:37,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:37,998 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 45 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:37,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1615 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 17:35:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2025-03-03 17:35:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4454976303317535) internal successors, (305), 211 states have internal predecessors, (305), 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:35:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 305 transitions. [2025-03-03 17:35:38,002 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 305 transitions. Word has length 40 [2025-03-03 17:35:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:38,002 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 305 transitions. [2025-03-03 17:35:38,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:35:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 305 transitions. [2025-03-03 17:35:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:35:38,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:38,003 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:35:38,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:35:38,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 286677802, now seen corresponding path program 1 times [2025-03-03 17:35:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820151669] [2025-03-03 17:35:38,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:38,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:38,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:35:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:35:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:38,334 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:35:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820151669] [2025-03-03 17:35:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820151669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602527584] [2025-03-03 17:35:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:38,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:38,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:38,336 INFO L87 Difference]: Start difference. First operand 212 states and 305 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:35:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:38,476 INFO L93 Difference]: Finished difference Result 418 states and 603 transitions. [2025-03-03 17:35:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:35:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:38,478 INFO L225 Difference]: With dead ends: 418 [2025-03-03 17:35:38,478 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 17:35:38,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:38,478 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 13 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:38,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 905 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 17:35:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2025-03-03 17:35:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.4396135265700483) internal successors, (298), 207 states have internal predecessors, (298), 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:35:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 298 transitions. [2025-03-03 17:35:38,486 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 298 transitions. Word has length 40 [2025-03-03 17:35:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:38,486 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 298 transitions. [2025-03-03 17:35:38,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:35:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 298 transitions. [2025-03-03 17:35:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 17:35:38,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:38,487 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:35:38,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:35:38,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:38,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash -348252221, now seen corresponding path program 1 times [2025-03-03 17:35:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731624454] [2025-03-03 17:35:38,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:38,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 17:35:38,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 17:35:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:38,872 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:35:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731624454] [2025-03-03 17:35:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731624454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:35:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82770870] [2025-03-03 17:35:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:38,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:35:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:38,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:35:38,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:38,875 INFO L87 Difference]: Start difference. First operand 208 states and 298 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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:35:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:39,213 INFO L93 Difference]: Finished difference Result 541 states and 769 transitions. [2025-03-03 17:35:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:39,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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:35:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:39,215 INFO L225 Difference]: With dead ends: 541 [2025-03-03 17:35:39,215 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 17:35:39,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:35:39,216 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 486 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:39,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1430 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 17:35:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 223. [2025-03-03 17:35:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.436936936936937) internal successors, (319), 222 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2025-03-03 17:35:39,226 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 41 [2025-03-03 17:35:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:39,226 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2025-03-03 17:35:39,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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:35:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2025-03-03 17:35:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:35:39,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:39,227 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:35:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:35:39,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash 901013255, now seen corresponding path program 1 times [2025-03-03 17:35:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508517097] [2025-03-03 17:35:39,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:39,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:35:39,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:35:39,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:39,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:39,515 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:35:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508517097] [2025-03-03 17:35:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508517097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768715108] [2025-03-03 17:35:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:39,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:39,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:39,518 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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:35:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:39,688 INFO L93 Difference]: Finished difference Result 540 states and 770 transitions. [2025-03-03 17:35:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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:35:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:39,690 INFO L225 Difference]: With dead ends: 540 [2025-03-03 17:35:39,690 INFO L226 Difference]: Without dead ends: 346 [2025-03-03 17:35:39,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:39,691 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 325 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:39,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 911 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-03 17:35:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 271. [2025-03-03 17:35:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4296296296296296) internal successors, (386), 270 states have internal predecessors, (386), 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:35:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 386 transitions. [2025-03-03 17:35:39,698 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 386 transitions. Word has length 42 [2025-03-03 17:35:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:39,698 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 386 transitions. [2025-03-03 17:35:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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:35:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 386 transitions. [2025-03-03 17:35:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:35:39,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:39,699 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:35:39,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:35:39,699 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:39,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash 955821511, now seen corresponding path program 1 times [2025-03-03 17:35:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995800793] [2025-03-03 17:35:39,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:39,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:35:39,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:35:39,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:39,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:40,029 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:35:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995800793] [2025-03-03 17:35:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995800793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:40,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696581559] [2025-03-03 17:35:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:40,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:40,030 INFO L87 Difference]: Start difference. First operand 271 states and 386 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:35:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:40,148 INFO L93 Difference]: Finished difference Result 510 states and 722 transitions. [2025-03-03 17:35:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:40,148 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:35:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:40,149 INFO L225 Difference]: With dead ends: 510 [2025-03-03 17:35:40,149 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 17:35:40,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:40,150 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 288 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:40,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 556 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 17:35:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 264. [2025-03-03 17:35:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.4220532319391634) internal successors, (374), 263 states have internal predecessors, (374), 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:35:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 374 transitions. [2025-03-03 17:35:40,155 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 374 transitions. Word has length 42 [2025-03-03 17:35:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:40,156 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 374 transitions. [2025-03-03 17:35:40,156 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:35:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 374 transitions. [2025-03-03 17:35:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 17:35:40,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:40,156 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:35:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:35:40,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -177756103, now seen corresponding path program 1 times [2025-03-03 17:35:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345709434] [2025-03-03 17:35:40,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:40,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 17:35:40,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 17:35:40,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:40,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:40,708 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:35:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345709434] [2025-03-03 17:35:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345709434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 17:35:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572225185] [2025-03-03 17:35:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 17:35:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:40,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 17:35:40,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:35:40,710 INFO L87 Difference]: Start difference. First operand 264 states and 374 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 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:35:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:41,169 INFO L93 Difference]: Finished difference Result 489 states and 693 transitions. [2025-03-03 17:35:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 17:35:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 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:35:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:41,170 INFO L225 Difference]: With dead ends: 489 [2025-03-03 17:35:41,171 INFO L226 Difference]: Without dead ends: 295 [2025-03-03 17:35:41,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:35:41,171 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 19 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:41,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2376 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-03 17:35:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 283. [2025-03-03 17:35:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.4184397163120568) internal successors, (400), 282 states have internal predecessors, (400), 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:35:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 400 transitions. [2025-03-03 17:35:41,176 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 400 transitions. Word has length 43 [2025-03-03 17:35:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:41,177 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 400 transitions. [2025-03-03 17:35:41,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 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:35:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 400 transitions. [2025-03-03 17:35:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 17:35:41,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:41,177 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:35:41,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:35:41,178 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -299059873, now seen corresponding path program 1 times [2025-03-03 17:35:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761471820] [2025-03-03 17:35:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 17:35:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 17:35:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:41,545 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:35:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761471820] [2025-03-03 17:35:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761471820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615384956] [2025-03-03 17:35:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:41,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:41,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:41,546 INFO L87 Difference]: Start difference. First operand 283 states and 400 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:35:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:41,654 INFO L93 Difference]: Finished difference Result 537 states and 756 transitions. [2025-03-03 17:35:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:41,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:35:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:41,656 INFO L225 Difference]: With dead ends: 537 [2025-03-03 17:35:41,656 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 17:35:41,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:41,658 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 362 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:41,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 557 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 17:35:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 254. [2025-03-03 17:35:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4189723320158103) internal successors, (359), 253 states have internal predecessors, (359), 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:35:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 359 transitions. [2025-03-03 17:35:41,664 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 359 transitions. Word has length 43 [2025-03-03 17:35:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 359 transitions. [2025-03-03 17:35:41,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:35:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 359 transitions. [2025-03-03 17:35:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:35:41,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:41,665 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:35:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:35:41,665 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1152211571, now seen corresponding path program 1 times [2025-03-03 17:35:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730509934] [2025-03-03 17:35:41,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:41,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:35:41,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:35:41,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:42,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:35:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730509934] [2025-03-03 17:35:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730509934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 17:35:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245962411] [2025-03-03 17:35:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 17:35:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 17:35:42,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-03 17:35:42,568 INFO L87 Difference]: Start difference. First operand 254 states and 359 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 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:35:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:43,393 INFO L93 Difference]: Finished difference Result 533 states and 752 transitions. [2025-03-03 17:35:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 17:35:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 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:35:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:43,395 INFO L225 Difference]: With dead ends: 533 [2025-03-03 17:35:43,395 INFO L226 Difference]: Without dead ends: 329 [2025-03-03 17:35:43,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 17:35:43,397 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 508 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:43,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2594 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-03 17:35:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 267. [2025-03-03 17:35:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.413533834586466) internal successors, (376), 266 states have internal predecessors, (376), 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:35:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 376 transitions. [2025-03-03 17:35:43,402 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 376 transitions. Word has length 44 [2025-03-03 17:35:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:43,402 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 376 transitions. [2025-03-03 17:35:43,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 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:35:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 376 transitions. [2025-03-03 17:35:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:35:43,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:43,403 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:35:43,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:35:43,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1030907801, now seen corresponding path program 1 times [2025-03-03 17:35:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491575974] [2025-03-03 17:35:43,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:43,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:35:43,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:35:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:43,697 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:35:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491575974] [2025-03-03 17:35:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491575974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72363523] [2025-03-03 17:35:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:43,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:43,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:43,700 INFO L87 Difference]: Start difference. First operand 267 states and 376 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:35:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:43,790 INFO L93 Difference]: Finished difference Result 506 states and 712 transitions. [2025-03-03 17:35:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:43,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:35:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:43,791 INFO L225 Difference]: With dead ends: 506 [2025-03-03 17:35:43,791 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 17:35:43,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:35:43,792 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 224 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 559 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 17:35:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2025-03-03 17:35:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4074074074074074) internal successors, (380), 270 states have internal predecessors, (380), 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:35:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 380 transitions. [2025-03-03 17:35:43,797 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 380 transitions. Word has length 44 [2025-03-03 17:35:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:43,797 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 380 transitions. [2025-03-03 17:35:43,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:35:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 380 transitions. [2025-03-03 17:35:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:35:43,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:43,798 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:35:43,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:35:43,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:43,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash -551880285, now seen corresponding path program 1 times [2025-03-03 17:35:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:43,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475413726] [2025-03-03 17:35:43,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:43,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:35:43,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:35:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:44,506 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:35:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:44,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475413726] [2025-03-03 17:35:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475413726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 17:35:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977754948] [2025-03-03 17:35:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:44,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 17:35:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:44,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 17:35:44,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:35:44,508 INFO L87 Difference]: Start difference. First operand 271 states and 380 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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:35:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:45,139 INFO L93 Difference]: Finished difference Result 568 states and 795 transitions. [2025-03-03 17:35:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 17:35:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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:35:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:45,141 INFO L225 Difference]: With dead ends: 568 [2025-03-03 17:35:45,141 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 17:35:45,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-03-03 17:35:45,142 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 490 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:45,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 2341 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 17:35:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 271. [2025-03-03 17:35:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4037037037037037) internal successors, (379), 270 states have internal predecessors, (379), 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:35:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 379 transitions. [2025-03-03 17:35:45,147 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 379 transitions. Word has length 44 [2025-03-03 17:35:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:45,148 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 379 transitions. [2025-03-03 17:35:45,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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:35:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2025-03-03 17:35:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:35:45,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:45,148 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:35:45,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:35:45,149 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash -673184055, now seen corresponding path program 1 times [2025-03-03 17:35:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732989635] [2025-03-03 17:35:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:45,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:35:45,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:35:45,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:45,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:45,663 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:35:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732989635] [2025-03-03 17:35:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732989635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 17:35:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556440269] [2025-03-03 17:35:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 17:35:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:45,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 17:35:45,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:35:45,665 INFO L87 Difference]: Start difference. First operand 271 states and 379 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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:35:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:46,075 INFO L93 Difference]: Finished difference Result 532 states and 743 transitions. [2025-03-03 17:35:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:35:46,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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:35:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:46,077 INFO L225 Difference]: With dead ends: 532 [2025-03-03 17:35:46,077 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 17:35:46,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:35:46,078 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 369 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:46,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1963 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 17:35:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 271. [2025-03-03 17:35:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4) internal successors, (378), 270 states have internal predecessors, (378), 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:35:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 378 transitions. [2025-03-03 17:35:46,082 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 378 transitions. Word has length 44 [2025-03-03 17:35:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:46,082 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 378 transitions. [2025-03-03 17:35:46,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 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:35:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 378 transitions. [2025-03-03 17:35:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:35:46,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:46,083 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:35:46,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:35:46,083 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1603134018, now seen corresponding path program 1 times [2025-03-03 17:35:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683064659] [2025-03-03 17:35:46,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:46,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:35:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:35:46,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:46,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:46,181 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:35:46,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:46,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683064659] [2025-03-03 17:35:46,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683064659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:46,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:46,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:46,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238773678] [2025-03-03 17:35:46,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:46,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:46,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:46,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:46,183 INFO L87 Difference]: Start difference. First operand 271 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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:35:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:46,278 INFO L93 Difference]: Finished difference Result 526 states and 733 transitions. [2025-03-03 17:35:46,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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:35:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:46,279 INFO L225 Difference]: With dead ends: 526 [2025-03-03 17:35:46,279 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 17:35:46,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:46,280 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 70 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:46,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 739 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 17:35:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 251. [2025-03-03 17:35:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.404) internal successors, (351), 250 states have internal predecessors, (351), 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:35:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2025-03-03 17:35:46,286 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 45 [2025-03-03 17:35:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:46,286 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2025-03-03 17:35:46,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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:35:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2025-03-03 17:35:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:35:46,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:46,290 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:35:46,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:35:46,291 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 969046321, now seen corresponding path program 1 times [2025-03-03 17:35:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889774741] [2025-03-03 17:35:46,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:35:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:35:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:46,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:35:46,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:35:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:35:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:46,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:35:46,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:35:46,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:35:46,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:35:46,390 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:46,419 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:35:46,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:35:46,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:35:46 BoogieIcfgContainer [2025-03-03 17:35:46,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:35:46,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:35:46,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:35:46,438 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:35:46,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:32" (3/4) ... [2025-03-03 17:35:46,440 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:35:46,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:35:46,442 INFO L158 Benchmark]: Toolchain (without parser) took 15649.45ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 124.0MB in the beginning and 291.6MB in the end (delta: -167.6MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,442 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:46,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 105.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.27ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 94.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,443 INFO L158 Benchmark]: Boogie Preprocessor took 91.37ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,443 INFO L158 Benchmark]: IcfgBuilder took 888.41ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 90.4MB in the end (delta: -2.6MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,444 INFO L158 Benchmark]: TraceAbstraction took 14277.11ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 90.4MB in the beginning and 291.7MB in the end (delta: -201.3MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,444 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 545.3MB. Free memory was 291.7MB in the beginning and 291.6MB in the end (delta: 74.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:46,445 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.24ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.85ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 105.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.27ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 94.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.37ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 88.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 888.41ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 90.4MB in the end (delta: -2.6MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14277.11ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 90.4MB in the beginning and 291.7MB in the end (delta: -201.3MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 545.3MB. Free memory was 291.7MB in the beginning and 291.6MB in the end (delta: 74.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 124, overapproximation of bitwiseOr at line 153, overapproximation of bitwiseOr at line 127, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 31); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (31 - 1); [L38] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 30); [L39] const SORT_57 msb_SORT_57 = (SORT_57)1 << (30 - 1); [L41] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L42] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L44] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 2); [L45] const SORT_65 msb_SORT_65 = (SORT_65)1 << (2 - 1); [L47] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 28); [L48] const SORT_71 msb_SORT_71 = (SORT_71)1 << (28 - 1); [L50] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 26); [L51] const SORT_73 msb_SORT_73 = (SORT_73)1 << (26 - 1); [L53] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 4); [L54] const SORT_79 msb_SORT_79 = (SORT_79)1 << (4 - 1); [L56] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 24); [L57] const SORT_85 msb_SORT_85 = (SORT_85)1 << (24 - 1); [L59] const SORT_87 mask_SORT_87 = (SORT_87)-1 >> (sizeof(SORT_87) * 8 - 20); [L60] const SORT_87 msb_SORT_87 = (SORT_87)1 << (20 - 1); [L62] const SORT_93 mask_SORT_93 = (SORT_93)-1 >> (sizeof(SORT_93) * 8 - 8); [L63] const SORT_93 msb_SORT_93 = (SORT_93)1 << (8 - 1); [L65] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 16); [L66] const SORT_99 msb_SORT_99 = (SORT_99)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_3 var_19 = 0; [L70] const SORT_3 var_40 = 1; [L72] SORT_1 input_2; [L73] SORT_3 input_4; [L74] SORT_5 input_6; [L75] SORT_3 input_7; [L77] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L77] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L78] SORT_5 state_13 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L79] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_5 init_10_arg_1 = var_8; [L82] state_9 = init_10_arg_1 [L83] SORT_5 init_14_arg_1 = var_8; [L84] state_13 = init_14_arg_1 [L85] SORT_3 init_21_arg_1 = var_19; [L86] state_20 = init_21_arg_1 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L89] input_2 = __VERIFIER_nondet_uchar() [L90] input_4 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uint() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L93] input_7 = input_7 & mask_SORT_3 [L96] SORT_5 var_11_arg_0 = state_9; [L97] SORT_5 var_11_arg_1 = var_8; [L98] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L99] SORT_3 var_12_arg_0 = var_11; [L100] SORT_3 var_12 = ~var_12_arg_0; [L101] SORT_5 var_15_arg_0 = state_13; [L102] SORT_5 var_15_arg_1 = var_8; [L103] SORT_3 var_15 = var_15_arg_0 == var_15_arg_1; [L104] SORT_3 var_16_arg_0 = var_15; [L105] SORT_3 var_16 = ~var_16_arg_0; [L106] SORT_3 var_17_arg_0 = var_12; [L107] SORT_3 var_17_arg_1 = var_16; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_17_arg_0=-2, var_17_arg_1=-2, var_40=1, var_8=0] [L108] EXPR var_17_arg_0 & var_17_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L108] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L109] SORT_3 var_18_arg_0 = var_17; [L110] SORT_3 var_18 = ~var_18_arg_0; [L111] SORT_3 var_22_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_22_arg_0=0, var_40=1, var_8=0] [L112] EXPR var_22_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L112] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L113] SORT_5 var_22 = var_22_arg_0; [L114] SORT_5 var_23_arg_0 = var_22; [L115] SORT_5 var_23_arg_1 = var_8; [L116] SORT_3 var_23 = var_23_arg_0 == var_23_arg_1; [L117] SORT_5 var_24_arg_0 = state_9; [L118] SORT_5 var_24_arg_1 = var_8; [L119] SORT_3 var_24 = var_24_arg_0 == var_24_arg_1; [L120] SORT_3 var_25_arg_0 = var_24; [L121] SORT_3 var_25 = ~var_25_arg_0; [L122] SORT_3 var_26_arg_0 = var_23; [L123] SORT_3 var_26_arg_1 = var_25; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_26_arg_0=1, var_26_arg_1=-2, var_40=1, var_8=0] [L124] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L124] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L125] SORT_3 var_27_arg_0 = var_18; [L126] SORT_3 var_27_arg_1 = var_26; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27_arg_0=-255, var_27_arg_1=255, var_40=1, var_8=0] [L127] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L127] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L128] SORT_5 var_28_arg_0 = state_9; [L129] SORT_5 var_28_arg_1 = var_8; [L130] SORT_3 var_28 = var_28_arg_0 == var_28_arg_1; [L131] SORT_5 var_29_arg_0 = state_13; [L132] SORT_5 var_29_arg_1 = var_8; [L133] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L134] SORT_3 var_30_arg_0 = var_28; [L135] SORT_3 var_30_arg_1 = var_29; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_30_arg_0=1, var_30_arg_1=1, var_40=1, var_8=0] [L136] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L136] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L137] SORT_3 var_31_arg_0 = var_30; [L138] SORT_3 var_31 = ~var_31_arg_0; [L139] SORT_3 var_32_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_32_arg_0=0, var_40=1, var_8=0] [L140] EXPR var_32_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L140] var_32_arg_0 = var_32_arg_0 & mask_SORT_3 [L141] SORT_5 var_32 = var_32_arg_0; [L142] SORT_5 var_33_arg_0 = var_32; [L143] SORT_5 var_33_arg_1 = var_8; [L144] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L145] SORT_5 var_34_arg_0 = state_9; [L146] SORT_5 var_34_arg_1 = var_8; [L147] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L148] SORT_3 var_35_arg_0 = var_33; [L149] SORT_3 var_35_arg_1 = var_34; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_35_arg_0=1, var_35_arg_1=1, var_40=1, var_8=0] [L150] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L150] SORT_3 var_35 = var_35_arg_0 | var_35_arg_1; [L151] SORT_3 var_36_arg_0 = var_31; [L152] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_36_arg_0=-2, var_36_arg_1=1, var_40=1, var_8=0] [L153] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L153] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L154] SORT_3 var_37_arg_0 = var_27; [L155] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_37_arg_0=256, var_37_arg_1=254, var_40=1, var_8=0] [L156] EXPR var_37_arg_0 & var_37_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L156] SORT_3 var_37 = var_37_arg_0 & var_37_arg_1; [L157] SORT_3 var_41_arg_0 = var_37; [L158] SORT_3 var_41 = ~var_41_arg_0; [L159] SORT_3 var_42_arg_0 = var_40; [L160] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_42_arg_0=1, var_42_arg_1=-1, var_8=0] [L161] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L161] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L162] EXPR var_42 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L162] var_42 = var_42 & mask_SORT_3 [L163] SORT_3 bad_43_arg_0 = var_42; [L164] CALL __VERIFIER_assert(!(bad_43_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3551 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3551 mSDsluCounter, 24641 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20978 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7922 IncrementalHoareTripleChecker+Invalid, 7941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3663 mSDtfsCounter, 7922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=14, InterpolantAutomatonStates: 179, 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, 20 MinimizatonAttempts, 531 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 795 ConstructedInterpolants, 0 QuantifiedInterpolants, 3661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:35:46,463 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.h_Spinner.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 c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:48,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:48,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:35:48,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:48,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:48,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:48,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:48,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:48,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:48,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:48,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:48,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:48,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:48,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:35:48,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:35:48,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:48,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:48,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:48,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:48,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:48,474 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2025-03-03 17:35:48,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:48,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:48,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:48,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:48,747 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:48,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:49,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd30f2a3/f4fcf4d6405944e7ae35b2bc41e8a6f0/FLAG3412bd49b [2025-03-03 17:35:50,148 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:50,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:50,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd30f2a3/f4fcf4d6405944e7ae35b2bc41e8a6f0/FLAG3412bd49b [2025-03-03 17:35:50,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbd30f2a3/f4fcf4d6405944e7ae35b2bc41e8a6f0 [2025-03-03 17:35:50,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:50,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:50,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:50,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:50,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:50,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711535bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50, skipping insertion in model container [2025-03-03 17:35:50,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:50,334 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.h_Spinner.c[1249,1262] [2025-03-03 17:35:50,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:50,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:50,428 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.h_Spinner.c[1249,1262] [2025-03-03 17:35:50,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:50,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:50,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50 WrapperNode [2025-03-03 17:35:50,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:50,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:50,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:50,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:50,483 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:35:50" (1/1) ... [2025-03-03 17:35:50,491 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:35:50" (1/1) ... [2025-03-03 17:35:50,516 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 285 [2025-03-03 17:35:50,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:50,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:50,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:50,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:50,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:50,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:50,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:50,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:50,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:50,557 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (1/1) ... [2025-03-03 17:35:50,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:50,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:50,581 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:35:50,583 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:35:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:35:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:50,689 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:50,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:50,970 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:50,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:50,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:50,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:50,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:50 BoogieIcfgContainer [2025-03-03 17:35:50,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:50,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:50,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:50,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:50,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:50" (1/3) ... [2025-03-03 17:35:50,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35860ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:50, skipping insertion in model container [2025-03-03 17:35:50,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:50" (2/3) ... [2025-03-03 17:35:50,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35860ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:50, skipping insertion in model container [2025-03-03 17:35:50,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:50" (3/3) ... [2025-03-03 17:35:50,986 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2025-03-03 17:35:50,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:50,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Spinner.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:51,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:51,041 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;@34aba0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:51,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:51,044 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:35:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:35:51,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:51,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:35:51,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:35:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:35:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704158238] [2025-03-03 17:35:51,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:51,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:51,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:51,065 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:35:51,067 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:35:51,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:35:51,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:35:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:51,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:51,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 17:35:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:35:51,382 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:35:51,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:35:51,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:35:51,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704158238] [2025-03-03 17:35:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704158238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:51,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925802594] [2025-03-03 17:35:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:35:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:51,401 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:35:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:51,452 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-03 17:35:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:51,455 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:35:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:51,458 INFO L225 Difference]: With dead ends: 16 [2025-03-03 17:35:51,458 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 17:35:51,460 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:35:51,463 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:51,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 17:35:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 17:35:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 17:35:51,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2025-03-03 17:35:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:51,482 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 17:35:51,482 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:35:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 17:35:51,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 17:35:51,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:35:51,493 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:35:51,687 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:35:51,689 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-03 17:35:51,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 17:35:51,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:35:51,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:35:51 BoogieIcfgContainer [2025-03-03 17:35:51,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:35:51,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:35:51,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:35:51,705 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:35:51,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:50" (3/4) ... [2025-03-03 17:35:51,707 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 17:35:51,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 17:35:51,716 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 17:35:51,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 17:35:51,717 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 17:35:51,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 17:35:51,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 17:35:51,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:35:51,789 INFO L158 Benchmark]: Toolchain (without parser) took 1605.47ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 34.1MB in the end (delta: 25.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,789 INFO L158 Benchmark]: CDTParser took 2.06ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:51,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.35ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 40.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.64ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 38.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:51,790 INFO L158 Benchmark]: Boogie Preprocessor took 38.41ms. Allocated memory is still 83.9MB. Free memory was 38.0MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,791 INFO L158 Benchmark]: IcfgBuilder took 422.12ms. Allocated memory is still 83.9MB. Free memory was 35.1MB in the beginning and 35.1MB in the end (delta: 45.2kB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,791 INFO L158 Benchmark]: TraceAbstraction took 724.82ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 42.3MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:51,791 INFO L158 Benchmark]: Witness Printer took 83.46ms. Allocated memory is still 83.9MB. Free memory was 42.3MB in the beginning and 34.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.06ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.35ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 40.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.64ms. Allocated memory is still 83.9MB. Free memory was 40.8MB in the beginning and 38.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.41ms. Allocated memory is still 83.9MB. Free memory was 38.0MB in the beginning and 35.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 422.12ms. Allocated memory is still 83.9MB. Free memory was 35.1MB in the beginning and 35.1MB in the end (delta: 45.2kB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 724.82ms. Allocated memory is still 83.9MB. Free memory was 34.0MB in the beginning and 42.3MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.46ms. Allocated memory is still 83.9MB. Free memory was 42.3MB in the beginning and 34.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 3 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 17:35:51,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE