./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:09:12,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:09:12,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:09:12,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:09:12,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:09:12,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:09:12,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:09:12,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:09:12,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:09:12,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:09:12,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:09:12,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:09:12,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:09:12,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:09:12,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:09:12,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:09:12,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:09:12,442 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-jdk21/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 -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-02-07 23:09:12,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:09:12,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:09:12,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:09:12,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:09:12,678 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:09:12,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:13,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd5de8ca1/10403437e9f647cf9fc695c2239f6be0/FLAG66b058ab1 [2025-02-07 23:09:14,121 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:09:14,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:14,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd5de8ca1/10403437e9f647cf9fc695c2239f6be0/FLAG66b058ab1 [2025-02-07 23:09:14,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd5de8ca1/10403437e9f647cf9fc695c2239f6be0 [2025-02-07 23:09:14,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:09:14,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:09:14,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:09:14,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:09:14,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:09:14,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:14,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e614eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14, skipping insertion in model container [2025-02-07 23:09:14,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:14,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:09:14,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-02-07 23:09:14,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:09:14,762 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:09:14,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-02-07 23:09:14,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:09:14,892 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:09:14,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14 WrapperNode [2025-02-07 23:09:14,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:09:14,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:09:14,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:09:14,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:09:14,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:14,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,200 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3784 [2025-02-07 23:09:15,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:09:15,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:09:15,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:09:15,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:09:15,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,348 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-02-07 23:09:15,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:09:15,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:09:15,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:09:15,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:09:15,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (1/1) ... [2025-02-07 23:09:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:09:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:09:15,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:09:15,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:09:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:09:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:09:15,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:09:15,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:09:15,881 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:09:15,882 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:09:18,836 INFO L? ?]: Removed 2117 outVars from TransFormulas that were not future-live. [2025-02-07 23:09:18,837 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:09:19,087 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:09:19,088 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:09:19,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:09:19 BoogieIcfgContainer [2025-02-07 23:09:19,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:09:19,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:09:19,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:09:19,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:09:19,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:09:14" (1/3) ... [2025-02-07 23:09:19,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158109c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:09:19, skipping insertion in model container [2025-02-07 23:09:19,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:14" (2/3) ... [2025-02-07 23:09:19,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158109c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:09:19, skipping insertion in model container [2025-02-07 23:09:19,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:09:19" (3/3) ... [2025-02-07 23:09:19,104 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:19,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:09:19,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 1326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:09:19,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:09:19,263 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;@3e228fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:09:19,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:09:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 1326 states, 1324 states have (on average 1.5022658610271904) internal successors, (1989), 1325 states have internal predecessors, (1989), 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-02-07 23:09:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 23:09:19,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:19,276 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, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:19,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:19,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -98425695, now seen corresponding path program 1 times [2025-02-07 23:09:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781983261] [2025-02-07 23:09:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:19,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 23:09:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 23:09:19,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:19,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781983261] [2025-02-07 23:09:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781983261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:20,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:09:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971141588] [2025-02-07 23:09:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:20,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:09:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:09:20,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:09:20,179 INFO L87 Difference]: Start difference. First operand has 1326 states, 1324 states have (on average 1.5022658610271904) internal successors, (1989), 1325 states have internal predecessors, (1989), 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 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-02-07 23:09:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:21,754 INFO L93 Difference]: Finished difference Result 2585 states and 3880 transitions. [2025-02-07 23:09:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:09:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-02-07 23:09:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:21,766 INFO L225 Difference]: With dead ends: 2585 [2025-02-07 23:09:21,767 INFO L226 Difference]: Without dead ends: 1332 [2025-02-07 23:09:21,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:09:21,772 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1937 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 2947 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:21,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 4996 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2947 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 23:09:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-02-07 23:09:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1331. [2025-02-07 23:09:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1330 states have (on average 1.5) internal successors, (1995), 1330 states have internal predecessors, (1995), 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-02-07 23:09:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1995 transitions. [2025-02-07 23:09:21,831 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1995 transitions. Word has length 76 [2025-02-07 23:09:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:21,831 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1995 transitions. [2025-02-07 23:09:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-02-07 23:09:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1995 transitions. [2025-02-07 23:09:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 23:09:21,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:21,833 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, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:21,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:09:21,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1801088894, now seen corresponding path program 1 times [2025-02-07 23:09:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997687699] [2025-02-07 23:09:21,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:21,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 23:09:21,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 23:09:21,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:21,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:22,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:22,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997687699] [2025-02-07 23:09:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997687699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:22,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437060679] [2025-02-07 23:09:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:09:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:09:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:09:22,056 INFO L87 Difference]: Start difference. First operand 1331 states and 1995 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-02-07 23:09:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:22,561 INFO L93 Difference]: Finished difference Result 1335 states and 1999 transitions. [2025-02-07 23:09:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2025-02-07 23:09:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:22,566 INFO L225 Difference]: With dead ends: 1335 [2025-02-07 23:09:22,566 INFO L226 Difference]: Without dead ends: 1333 [2025-02-07 23:09:22,567 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-02-07 23:09:22,567 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:22,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4963 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:09:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-07 23:09:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2025-02-07 23:09:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.4992492492492493) internal successors, (1997), 1332 states have internal predecessors, (1997), 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-02-07 23:09:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1997 transitions. [2025-02-07 23:09:22,642 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1997 transitions. Word has length 77 [2025-02-07 23:09:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1997 transitions. [2025-02-07 23:09:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-02-07 23:09:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1997 transitions. [2025-02-07 23:09:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 23:09:22,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:22,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:22,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:09:22,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash 5500333, now seen corresponding path program 1 times [2025-02-07 23:09:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:22,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206499033] [2025-02-07 23:09:22,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:09:22,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:09:22,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:22,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206499033] [2025-02-07 23:09:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206499033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:22,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876133682] [2025-02-07 23:09:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:22,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:09:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:22,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:09:22,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:09:22,798 INFO L87 Difference]: Start difference. First operand 1333 states and 1997 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-02-07 23:09:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:23,367 INFO L93 Difference]: Finished difference Result 2595 states and 3888 transitions. [2025-02-07 23:09:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-02-07 23:09:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:23,373 INFO L225 Difference]: With dead ends: 2595 [2025-02-07 23:09:23,373 INFO L226 Difference]: Without dead ends: 1335 [2025-02-07 23:09:23,375 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-02-07 23:09:23,376 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 3304 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4960 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:23,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4960 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:09:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-02-07 23:09:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2025-02-07 23:09:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 1.4985007496251874) internal successors, (1999), 1334 states have internal predecessors, (1999), 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-02-07 23:09:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1999 transitions. [2025-02-07 23:09:23,402 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1999 transitions. Word has length 78 [2025-02-07 23:09:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:23,402 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1999 transitions. [2025-02-07 23:09:23,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-02-07 23:09:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1999 transitions. [2025-02-07 23:09:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 23:09:23,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:23,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:23,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:09:23,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:23,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2102021597, now seen corresponding path program 1 times [2025-02-07 23:09:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062345360] [2025-02-07 23:09:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:23,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:23,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 23:09:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 23:09:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062345360] [2025-02-07 23:09:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062345360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088015280] [2025-02-07 23:09:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:09:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:23,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:09:23,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:09:23,519 INFO L87 Difference]: Start difference. First operand 1335 states and 1999 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-02-07 23:09:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:23,992 INFO L93 Difference]: Finished difference Result 2599 states and 3892 transitions. [2025-02-07 23:09:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-02-07 23:09:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:23,996 INFO L225 Difference]: With dead ends: 2599 [2025-02-07 23:09:23,996 INFO L226 Difference]: Without dead ends: 1337 [2025-02-07 23:09:23,997 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-02-07 23:09:23,998 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 0 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:23,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4955 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:09:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-02-07 23:09:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1337. [2025-02-07 23:09:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1336 states have (on average 1.497754491017964) internal successors, (2001), 1336 states have internal predecessors, (2001), 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-02-07 23:09:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2001 transitions. [2025-02-07 23:09:24,016 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2001 transitions. Word has length 79 [2025-02-07 23:09:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:24,016 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 2001 transitions. [2025-02-07 23:09:24,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-02-07 23:09:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2001 transitions. [2025-02-07 23:09:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 23:09:24,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:24,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:24,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:09:24,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:24,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1668442670, now seen corresponding path program 1 times [2025-02-07 23:09:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134825224] [2025-02-07 23:09:24,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:24,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 23:09:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 23:09:24,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:24,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:24,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134825224] [2025-02-07 23:09:24,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134825224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:24,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:24,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:24,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715208675] [2025-02-07 23:09:24,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:24,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:09:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:24,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:09:24,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:09:24,178 INFO L87 Difference]: Start difference. First operand 1337 states and 2001 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-07 23:09:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:24,700 INFO L93 Difference]: Finished difference Result 2612 states and 3907 transitions. [2025-02-07 23:09:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:24,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-07 23:09:24,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:24,705 INFO L225 Difference]: With dead ends: 2612 [2025-02-07 23:09:24,705 INFO L226 Difference]: Without dead ends: 1348 [2025-02-07 23:09:24,706 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-02-07 23:09:24,707 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 3 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:24,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4955 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:09:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-02-07 23:09:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1344. [2025-02-07 23:09:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.4966492926284438) internal successors, (2010), 1343 states have internal predecessors, (2010), 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-02-07 23:09:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2010 transitions. [2025-02-07 23:09:24,726 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2010 transitions. Word has length 80 [2025-02-07 23:09:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:24,726 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2010 transitions. [2025-02-07 23:09:24,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-02-07 23:09:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2010 transitions. [2025-02-07 23:09:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 23:09:24,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:24,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:24,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:09:24,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:24,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash 517684280, now seen corresponding path program 1 times [2025-02-07 23:09:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:24,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80076539] [2025-02-07 23:09:24,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:24,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 23:09:24,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 23:09:24,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:24,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80076539] [2025-02-07 23:09:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80076539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734587498] [2025-02-07 23:09:25,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:25,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:09:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:25,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:09:25,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:09:25,952 INFO L87 Difference]: Start difference. First operand 1344 states and 2010 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-02-07 23:09:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:26,786 INFO L93 Difference]: Finished difference Result 2615 states and 3911 transitions. [2025-02-07 23:09:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-07 23:09:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:26,791 INFO L225 Difference]: With dead ends: 2615 [2025-02-07 23:09:26,791 INFO L226 Difference]: Without dead ends: 1344 [2025-02-07 23:09:26,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:09:26,794 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 1925 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 4943 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:26,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 4943 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:09:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-02-07 23:09:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2025-02-07 23:09:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 1.4959046909903202) internal successors, (2009), 1343 states have internal predecessors, (2009), 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-02-07 23:09:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2009 transitions. [2025-02-07 23:09:26,813 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2009 transitions. Word has length 81 [2025-02-07 23:09:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2009 transitions. [2025-02-07 23:09:26,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-02-07 23:09:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2009 transitions. [2025-02-07 23:09:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 23:09:26,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:26,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:09:26,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash -498689035, now seen corresponding path program 1 times [2025-02-07 23:09:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902751563] [2025-02-07 23:09:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:26,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 23:09:26,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 23:09:26,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:26,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:09:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902751563] [2025-02-07 23:09:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902751563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:09:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281758129] [2025-02-07 23:09:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:27,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:09:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:09:27,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:09:27,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:09:27,030 INFO L87 Difference]: Start difference. First operand 1344 states and 2009 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-02-07 23:09:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:28,799 INFO L93 Difference]: Finished difference Result 3867 states and 5782 transitions. [2025-02-07 23:09:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:09:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-07 23:09:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:28,807 INFO L225 Difference]: With dead ends: 3867 [2025-02-07 23:09:28,807 INFO L226 Difference]: Without dead ends: 2596 [2025-02-07 23:09:28,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:09:28,810 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 1900 mSDsluCounter, 3719 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:28,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 4983 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 23:09:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2025-02-07 23:09:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 1406. [2025-02-07 23:09:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.493238434163701) internal successors, (2098), 1405 states have internal predecessors, (2098), 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-02-07 23:09:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2098 transitions. [2025-02-07 23:09:28,833 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2098 transitions. Word has length 81 [2025-02-07 23:09:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:28,833 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2098 transitions. [2025-02-07 23:09:28,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-02-07 23:09:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2098 transitions. [2025-02-07 23:09:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-07 23:09:28,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:28,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 23:09:28,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:09:28,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:28,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:28,835 INFO L85 PathProgramCache]: Analyzing trace with hash 905772033, now seen corresponding path program 1 times [2025-02-07 23:09:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:09:28,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914412563] [2025-02-07 23:09:28,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:09:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 23:09:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 23:09:28,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:09:28,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:09:28,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 23:09:28,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 23:09:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:09:28,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:09:28,949 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:09:28,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:09:28,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:09:28,952 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:09:29,013 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:09:29,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:09:29,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:09:29 BoogieIcfgContainer [2025-02-07 23:09:29,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:09:29,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:09:29,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:09:29,039 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:09:29,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:09:19" (3/4) ... [2025-02-07 23:09:29,041 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:09:29,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:09:29,043 INFO L158 Benchmark]: Toolchain (without parser) took 14640.22ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 112.2MB in the beginning and 305.0MB in the end (delta: -192.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,044 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:09:29,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.43ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 61.1MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 303.60ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 61.1MB in the beginning and 55.3MB in the end (delta: 5.8MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,044 INFO L158 Benchmark]: Boogie Preprocessor took 383.69ms. Allocated memory was 151.0MB in the beginning and 427.8MB in the end (delta: 276.8MB). Free memory was 55.3MB in the beginning and 314.4MB in the end (delta: -259.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,045 INFO L158 Benchmark]: IcfgBuilder took 3501.91ms. Allocated memory was 427.8MB in the beginning and 654.3MB in the end (delta: 226.5MB). Free memory was 314.4MB in the beginning and 489.7MB in the end (delta: -175.3MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,045 INFO L158 Benchmark]: TraceAbstraction took 9948.27ms. Allocated memory was 654.3MB in the beginning and 419.4MB in the end (delta: -234.9MB). Free memory was 489.7MB in the beginning and 305.1MB in the end (delta: 184.6MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. [2025-02-07 23:09:29,046 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 419.4MB. Free memory was 305.1MB in the beginning and 305.0MB in the end (delta: 54.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:09:29,047 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.43ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 61.1MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 303.60ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 61.1MB in the beginning and 55.3MB in the end (delta: 5.8MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 383.69ms. Allocated memory was 151.0MB in the beginning and 427.8MB in the end (delta: 276.8MB). Free memory was 55.3MB in the beginning and 314.4MB in the end (delta: -259.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * IcfgBuilder took 3501.91ms. Allocated memory was 427.8MB in the beginning and 654.3MB in the end (delta: 226.5MB). Free memory was 314.4MB in the beginning and 489.7MB in the end (delta: -175.3MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9948.27ms. Allocated memory was 654.3MB in the beginning and 419.4MB in the end (delta: -234.9MB). Free memory was 489.7MB in the beginning and 305.1MB in the end (delta: 184.6MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 419.4MB. Free memory was 305.1MB in the beginning and 305.0MB in the end (delta: 54.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 186, overapproximation of bitwiseAnd at line 184. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_43 = 1; [L41] const SORT_4 var_44 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 3; [L44] const SORT_2 var_59 = 2; [L45] const SORT_2 var_62 = 1; [L46] const SORT_2 var_70 = 255; [L47] const SORT_3 var_74 = 0; [L48] const SORT_4 var_78 = 255; [L50] SORT_1 input_53; [L51] SORT_1 input_55; [L52] SORT_1 input_57; [L53] SORT_1 input_58; [L54] SORT_1 input_60; [L55] SORT_1 input_61; [L56] SORT_1 input_71; [L57] SORT_1 input_72; [L58] SORT_1 input_73; [L59] SORT_1 input_90; [L60] SORT_1 input_91; [L61] SORT_1 input_106; [L62] SORT_1 input_107; [L63] SORT_1 input_124; [L64] SORT_1 input_132; [L65] SORT_1 input_140; [L66] SORT_1 input_148; [L67] SORT_1 input_156; [L68] SORT_1 input_164; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L70] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L71] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L72] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L73] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L74] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L75] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L76] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L77] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L78] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L79] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L80] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L81] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L82] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L83] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L84] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L85] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L86] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L87] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] SORT_2 init_7_arg_1 = var_5; [L90] state_6 = init_7_arg_1 [L91] SORT_2 init_9_arg_1 = var_5; [L92] state_8 = init_9_arg_1 [L93] SORT_2 init_11_arg_1 = var_5; [L94] state_10 = init_11_arg_1 [L95] SORT_2 init_13_arg_1 = var_5; [L96] state_12 = init_13_arg_1 [L97] SORT_1 init_16_arg_1 = var_14; [L98] state_15 = init_16_arg_1 [L99] SORT_1 init_18_arg_1 = var_14; [L100] state_17 = init_18_arg_1 [L101] SORT_1 init_20_arg_1 = var_14; [L102] state_19 = init_20_arg_1 [L103] SORT_1 init_22_arg_1 = var_14; [L104] state_21 = init_22_arg_1 [L105] SORT_1 init_24_arg_1 = var_14; [L106] state_23 = init_24_arg_1 [L107] SORT_1 init_26_arg_1 = var_14; [L108] state_25 = init_26_arg_1 [L109] SORT_1 init_28_arg_1 = var_14; [L110] state_27 = init_28_arg_1 [L111] SORT_1 init_30_arg_1 = var_14; [L112] state_29 = init_30_arg_1 [L113] SORT_1 init_32_arg_1 = var_14; [L114] state_31 = init_32_arg_1 [L115] SORT_1 init_34_arg_1 = var_14; [L116] state_33 = init_34_arg_1 [L117] SORT_1 init_36_arg_1 = var_14; [L118] state_35 = init_36_arg_1 [L119] SORT_1 init_38_arg_1 = var_14; [L120] state_37 = init_38_arg_1 [L121] SORT_1 init_40_arg_1 = var_14; [L122] state_39 = init_40_arg_1 [L123] SORT_1 init_42_arg_1 = var_14; [L124] state_41 = init_42_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L127] input_53 = __VERIFIER_nondet_uchar() [L128] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L128] input_53 = input_53 & mask_SORT_1 [L129] input_55 = __VERIFIER_nondet_uchar() [L130] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L130] input_55 = input_55 & mask_SORT_1 [L131] input_57 = __VERIFIER_nondet_uchar() [L132] EXPR input_57 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L132] input_57 = input_57 & mask_SORT_1 [L133] input_58 = __VERIFIER_nondet_uchar() [L134] EXPR input_58 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L134] input_58 = input_58 & mask_SORT_1 [L135] input_60 = __VERIFIER_nondet_uchar() [L136] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L136] input_60 = input_60 & mask_SORT_1 [L137] input_61 = __VERIFIER_nondet_uchar() [L138] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L138] input_61 = input_61 & mask_SORT_1 [L139] input_71 = __VERIFIER_nondet_uchar() [L140] EXPR input_71 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L140] input_71 = input_71 & mask_SORT_1 [L141] input_72 = __VERIFIER_nondet_uchar() [L142] EXPR input_72 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L142] input_72 = input_72 & mask_SORT_1 [L143] input_73 = __VERIFIER_nondet_uchar() [L144] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L144] input_73 = input_73 & mask_SORT_1 [L145] input_90 = __VERIFIER_nondet_uchar() [L146] EXPR input_90 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L146] input_90 = input_90 & mask_SORT_1 [L147] input_91 = __VERIFIER_nondet_uchar() [L148] EXPR input_91 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L148] input_91 = input_91 & mask_SORT_1 [L149] input_106 = __VERIFIER_nondet_uchar() [L150] EXPR input_106 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L150] input_106 = input_106 & mask_SORT_1 [L151] input_107 = __VERIFIER_nondet_uchar() [L152] EXPR input_107 & mask_SORT_1 VAL [input_106=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L152] input_107 = input_107 & mask_SORT_1 [L153] input_124 = __VERIFIER_nondet_uchar() [L154] input_132 = __VERIFIER_nondet_uchar() [L155] input_140 = __VERIFIER_nondet_uchar() [L156] input_148 = __VERIFIER_nondet_uchar() [L157] input_156 = __VERIFIER_nondet_uchar() [L158] input_164 = __VERIFIER_nondet_uchar() [L161] SORT_1 var_45_arg_0 = state_23; [L162] SORT_4 var_45_arg_1 = var_43; [L163] SORT_4 var_45_arg_2 = var_44; [L164] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L165] SORT_1 var_46_arg_0 = state_31; [L166] SORT_4 var_46_arg_1 = var_43; [L167] SORT_4 var_46_arg_2 = var_44; [L168] SORT_4 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L169] SORT_4 var_47_arg_0 = var_45; [L170] SORT_4 var_47_arg_1 = var_46; [L171] SORT_4 var_47 = var_47_arg_0 + var_47_arg_1; [L172] SORT_1 var_48_arg_0 = state_39; [L173] SORT_4 var_48_arg_1 = var_43; [L174] SORT_4 var_48_arg_2 = var_44; [L175] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L176] SORT_4 var_49_arg_0 = var_47; [L177] SORT_4 var_49_arg_1 = var_48; [L178] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_49=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] EXPR var_49 & mask_SORT_4 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] var_49 = var_49 & mask_SORT_4 [L180] SORT_4 var_50_arg_0 = var_49; [L181] SORT_4 var_50_arg_1 = var_43; [L182] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L183] SORT_1 var_51_arg_0 = ~state_41; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L185] SORT_1 var_51_arg_1 = ~var_50; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L187] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L187] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L188] EXPR var_51 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L188] var_51 = var_51 & mask_SORT_1 [L189] SORT_1 bad_52_arg_0 = var_51; [L190] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1326 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5765 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5765 mSDsluCounter, 34755 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23966 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10796 IncrementalHoareTripleChecker+Invalid, 10799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10789 mSDtfsCounter, 10796 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1406occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1195 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 2492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-02-07 23:09:29,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:09:31,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:09:31,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:09:31,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:09:31,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:09:31,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:09:31,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:09:31,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:09:31,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:09:31,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:09:31,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:09:31,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:09:31,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:09:31,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:09:31,179 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:09:31,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:09:31,180 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:09:31,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:09:31,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:09:31,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:09:31,181 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-jdk21/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 -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-02-07 23:09:31,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:09:31,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:09:31,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:09:31,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:09:31,465 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:09:31,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:32,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d693dd41a/ef90cccba73042539a4f15e1c49ca7be/FLAGf8c0a3ad3 [2025-02-07 23:09:33,037 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:09:33,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:33,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d693dd41a/ef90cccba73042539a4f15e1c49ca7be/FLAGf8c0a3ad3 [2025-02-07 23:09:33,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d693dd41a/ef90cccba73042539a4f15e1c49ca7be [2025-02-07 23:09:33,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:09:33,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:09:33,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:09:33,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:09:33,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:09:33,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4e91bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33, skipping insertion in model container [2025-02-07 23:09:33,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:09:33,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-02-07 23:09:33,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:09:33,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:09:33,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-02-07 23:09:33,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:09:33,493 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:09:33,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33 WrapperNode [2025-02-07 23:09:33,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:09:33,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:09:33,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:09:33,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:09:33,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,562 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1148 [2025-02-07 23:09:33,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:09:33,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:09:33,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:09:33,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:09:33,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,604 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-02-07 23:09:33,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:09:33,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:09:33,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:09:33,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:09:33,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (1/1) ... [2025-02-07 23:09:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:09:33,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:09:33,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 23:09:33,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 23:09:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:09:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:09:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:09:33,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:09:33,942 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:09:33,943 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:09:34,859 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-02-07 23:09:34,860 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:09:34,866 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:09:34,866 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:09:34,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:09:34 BoogieIcfgContainer [2025-02-07 23:09:34,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:09:34,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:09:34,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:09:34,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:09:34,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:09:33" (1/3) ... [2025-02-07 23:09:34,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2147ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:09:34, skipping insertion in model container [2025-02-07 23:09:34,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:09:33" (2/3) ... [2025-02-07 23:09:34,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2147ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:09:34, skipping insertion in model container [2025-02-07 23:09:34,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:09:34" (3/3) ... [2025-02-07 23:09:34,874 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-02-07 23:09:34,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:09:34,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:09:34,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:09:34,925 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;@107956cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:09:34,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:09:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:09:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:09:34,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:34,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:09:34,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:34,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:09:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:09:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546020356] [2025-02-07 23:09:34,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:34,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:09:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:09:34,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:09:34,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:09:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:09:35,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:09:35,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:35,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:35,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 23:09:35,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:09:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:09:35,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:09:35,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:09:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546020356] [2025-02-07 23:09:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546020356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:09:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:09:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:09:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314397253] [2025-02-07 23:09:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:09:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:09:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:09:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:09:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:09:35,353 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:09:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:09:35,414 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:09:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:09:35,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-07 23:09:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:09:35,419 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:09:35,419 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:09:35,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-07 23:09:35,422 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:09:35,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:09:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:09:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:09:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-02-07 23:09:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:09:35,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:09:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:09:35,438 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:09:35,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-07 23:09:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:09:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:09:35,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:09:35,438 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:09:35,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 23:09:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:09:35,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:09:35,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:09:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:09:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:09:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149478175] [2025-02-07 23:09:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:09:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:09:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:09:35,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:09:35,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 23:09:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:09:35,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:09:35,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:09:35,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:09:35,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-07 23:09:35,953 INFO L279 TraceCheckSpWp]: Computing forward predicates...