./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:16:11,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:16:11,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:16:11,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:16:11,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:16:11,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:16:11,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:16:11,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:16:11,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:16:11,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:16:11,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:16:11,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:16:11,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:16:11,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:16:11,837 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:16:11,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:16:11,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:16:11,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:11,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:16:11,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:16:11,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:16:11,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:16:11,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:16:11,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:16:11,840 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 -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2025-02-05 20:16:12,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:16:12,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:16:12,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:16:12,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:16:12,013 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:16:12,014 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.vis_arrays_vsaR_p15.c [2025-02-05 20:16:13,058 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6695a30b/aa588911b0224e2087636410eb8c82e0/FLAG0fb5a8598 [2025-02-05 20:16:13,376 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:16:13,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-05 20:16:13,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6695a30b/aa588911b0224e2087636410eb8c82e0/FLAG0fb5a8598 [2025-02-05 20:16:13,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6695a30b/aa588911b0224e2087636410eb8c82e0 [2025-02-05 20:16:13,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:16:13,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:16:13,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:13,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:16:13,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:16:13,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:13" (1/1) ... [2025-02-05 20:16:13,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:13, skipping insertion in model container [2025-02-05 20:16:13,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:13" (1/1) ... [2025-02-05 20:16:13,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:16:13,810 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-05 20:16:14,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:14,022 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:16:14,028 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-05 20:16:14,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:14,123 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:16:14,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14 WrapperNode [2025-02-05 20:16:14,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:14,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:14,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:16:14,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:16:14,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,342 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2148 [2025-02-05 20:16:14,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:14,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:16:14,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:16:14,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:16:14,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,441 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-05 20:16:14,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:16:14,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:16:14,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:16:14,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:16:14,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (1/1) ... [2025-02-05 20:16:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:14,638 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-05 20:16:14,653 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-05 20:16:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:16:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:16:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:16:14,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:16:14,917 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:16:14,919 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:16:16,595 INFO L? ?]: Removed 1344 outVars from TransFormulas that were not future-live. [2025-02-05 20:16:16,596 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:16:16,692 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:16:16,692 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:16:16,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:16 BoogieIcfgContainer [2025-02-05 20:16:16,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:16:16,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:16:16,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:16:16,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:16:16,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:16:13" (1/3) ... [2025-02-05 20:16:16,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765c8b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:16, skipping insertion in model container [2025-02-05 20:16:16,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:14" (2/3) ... [2025-02-05 20:16:16,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765c8b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:16, skipping insertion in model container [2025-02-05 20:16:16,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:16" (3/3) ... [2025-02-05 20:16:16,702 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-05 20:16:16,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:16:16,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c that has 1 procedures, 543 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:16:16,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:16:16,812 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;@779fc597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:16:16,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:16:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 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-05 20:16:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:16:16,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:16,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:16,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1097220311, now seen corresponding path program 1 times [2025-02-05 20:16:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071198151] [2025-02-05 20:16:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:16,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:16:16,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:16:16,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:16,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:17,289 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-05 20:16:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071198151] [2025-02-05 20:16:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071198151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:17,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:17,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946035984] [2025-02-05 20:16:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:17,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:17,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:17,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:17,362 INFO L87 Difference]: Start difference. First operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 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 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:17,696 INFO L93 Difference]: Finished difference Result 1031 states and 1543 transitions. [2025-02-05 20:16:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 20:16:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:17,704 INFO L225 Difference]: With dead ends: 1031 [2025-02-05 20:16:17,705 INFO L226 Difference]: Without dead ends: 542 [2025-02-05 20:16:17,709 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-05 20:16:17,712 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:17,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2011 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-05 20:16:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-02-05 20:16:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4953789279112755) internal successors, (809), 541 states have internal predecessors, (809), 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-05 20:16:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 809 transitions. [2025-02-05 20:16:17,770 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 809 transitions. Word has length 45 [2025-02-05 20:16:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:17,770 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 809 transitions. [2025-02-05 20:16:17,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 809 transitions. [2025-02-05 20:16:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 20:16:17,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:17,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:16:17,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -341228789, now seen corresponding path program 1 times [2025-02-05 20:16:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130095722] [2025-02-05 20:16:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:17,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 20:16:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 20:16:17,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:17,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:17,939 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-05 20:16:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130095722] [2025-02-05 20:16:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130095722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869467752] [2025-02-05 20:16:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:17,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:17,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:17,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:17,941 INFO L87 Difference]: Start difference. First operand 542 states and 809 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-05 20:16:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:18,196 INFO L93 Difference]: Finished difference Result 1032 states and 1541 transitions. [2025-02-05 20:16:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-02-05 20:16:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:18,199 INFO L225 Difference]: With dead ends: 1032 [2025-02-05 20:16:18,199 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 20:16:18,203 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-05 20:16:18,204 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:18,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2008 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:16:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 20:16:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-02-05 20:16:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4935543278084715) internal successors, (811), 543 states have internal predecessors, (811), 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-05 20:16:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 811 transitions. [2025-02-05 20:16:18,227 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 811 transitions. Word has length 46 [2025-02-05 20:16:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:18,227 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 811 transitions. [2025-02-05 20:16:18,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-05 20:16:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 811 transitions. [2025-02-05 20:16:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 20:16:18,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:18,228 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] [2025-02-05 20:16:18,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:16:18,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:18,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash -56647854, now seen corresponding path program 1 times [2025-02-05 20:16:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:18,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440898684] [2025-02-05 20:16:18,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:18,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 20:16:18,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 20:16:18,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:18,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:18,529 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-05 20:16:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440898684] [2025-02-05 20:16:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440898684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976788639] [2025-02-05 20:16:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:18,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:18,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:18,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:18,530 INFO L87 Difference]: Start difference. First operand 544 states and 811 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05 20:16:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:18,833 INFO L93 Difference]: Finished difference Result 1038 states and 1548 transitions. [2025-02-05 20:16:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-02-05 20:16:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:18,837 INFO L225 Difference]: With dead ends: 1038 [2025-02-05 20:16:18,841 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 20:16:18,842 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-05 20:16:18,843 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 2 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:18,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2004 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 20:16:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2025-02-05 20:16:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.491743119266055) internal successors, (813), 545 states have internal predecessors, (813), 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-05 20:16:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 813 transitions. [2025-02-05 20:16:18,851 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 813 transitions. Word has length 47 [2025-02-05 20:16:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:18,852 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 813 transitions. [2025-02-05 20:16:18,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05 20:16:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 813 transitions. [2025-02-05 20:16:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 20:16:18,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:18,853 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] [2025-02-05 20:16:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:16:18,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 132279824, now seen corresponding path program 1 times [2025-02-05 20:16:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352924238] [2025-02-05 20:16:18,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:18,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:16:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:16:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:19,085 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-05 20:16:19,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352924238] [2025-02-05 20:16:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352924238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:19,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:19,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355377951] [2025-02-05 20:16:19,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:19,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:19,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:19,086 INFO L87 Difference]: Start difference. First operand 546 states and 813 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-05 20:16:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:19,631 INFO L93 Difference]: Finished difference Result 1042 states and 1552 transitions. [2025-02-05 20:16:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:19,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 48 [2025-02-05 20:16:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:19,634 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 20:16:19,634 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 20:16:19,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:19,635 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:19,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3332 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 20:16:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2025-02-05 20:16:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4908759124087592) internal successors, (817), 548 states have internal predecessors, (817), 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-05 20:16:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 817 transitions. [2025-02-05 20:16:19,650 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 817 transitions. Word has length 48 [2025-02-05 20:16:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 817 transitions. [2025-02-05 20:16:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-05 20:16:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 817 transitions. [2025-02-05 20:16:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 20:16:19,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:19,653 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] [2025-02-05 20:16:19,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:16:19,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1617959669, now seen corresponding path program 1 times [2025-02-05 20:16:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871649402] [2025-02-05 20:16:19,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:16:19,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:16:19,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:19,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:19,789 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-05 20:16:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871649402] [2025-02-05 20:16:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871649402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878288399] [2025-02-05 20:16:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:19,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:19,791 INFO L87 Difference]: Start difference. First operand 549 states and 817 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-05 20:16:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:20,059 INFO L93 Difference]: Finished difference Result 1050 states and 1563 transitions. [2025-02-05 20:16:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 48 [2025-02-05 20:16:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:20,063 INFO L225 Difference]: With dead ends: 1050 [2025-02-05 20:16:20,064 INFO L226 Difference]: Without dead ends: 555 [2025-02-05 20:16:20,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:20,065 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 4 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:20,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2674 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:16:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-05 20:16:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2025-02-05 20:16:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4891696750902528) internal successors, (825), 554 states have internal predecessors, (825), 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-05 20:16:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 825 transitions. [2025-02-05 20:16:20,075 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 825 transitions. Word has length 48 [2025-02-05 20:16:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:20,075 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 825 transitions. [2025-02-05 20:16:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-05 20:16:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 825 transitions. [2025-02-05 20:16:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 20:16:20,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:20,076 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] [2025-02-05 20:16:20,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:16:20,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:20,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash 8643250, now seen corresponding path program 1 times [2025-02-05 20:16:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175073486] [2025-02-05 20:16:20,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:20,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:16:20,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:16:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:20,558 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-05 20:16:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175073486] [2025-02-05 20:16:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175073486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:20,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:20,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:16:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091228053] [2025-02-05 20:16:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:16:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:20,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:16:20,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:16:20,560 INFO L87 Difference]: Start difference. First operand 555 states and 825 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-05 20:16:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:21,087 INFO L93 Difference]: Finished difference Result 1061 states and 1577 transitions. [2025-02-05 20:16:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:16:21,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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 49 [2025-02-05 20:16:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:21,090 INFO L225 Difference]: With dead ends: 1061 [2025-02-05 20:16:21,090 INFO L226 Difference]: Without dead ends: 560 [2025-02-05 20:16:21,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:16:21,091 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 778 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:21,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 3309 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-05 20:16:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 559. [2025-02-05 20:16:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.4874551971326164) internal successors, (830), 558 states have internal predecessors, (830), 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-05 20:16:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 830 transitions. [2025-02-05 20:16:21,102 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 830 transitions. Word has length 49 [2025-02-05 20:16:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:21,102 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 830 transitions. [2025-02-05 20:16:21,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 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-05 20:16:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 830 transitions. [2025-02-05 20:16:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 20:16:21,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:21,105 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] [2025-02-05 20:16:21,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:16:21,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2055365912, now seen corresponding path program 1 times [2025-02-05 20:16:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:21,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257461261] [2025-02-05 20:16:21,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:21,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 20:16:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 20:16:21,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:21,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:21,323 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-05 20:16:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:21,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257461261] [2025-02-05 20:16:21,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257461261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:21,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:21,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631657217] [2025-02-05 20:16:21,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:21,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:21,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:21,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:21,325 INFO L87 Difference]: Start difference. First operand 559 states and 830 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-05 20:16:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:21,591 INFO L93 Difference]: Finished difference Result 1066 states and 1583 transitions. [2025-02-05 20:16:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2025-02-05 20:16:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:21,594 INFO L225 Difference]: With dead ends: 1066 [2025-02-05 20:16:21,594 INFO L226 Difference]: Without dead ends: 561 [2025-02-05 20:16:21,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:21,595 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 779 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:21,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 2000 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:16:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-05 20:16:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-02-05 20:16:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4857142857142858) internal successors, (832), 560 states have internal predecessors, (832), 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-05 20:16:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 832 transitions. [2025-02-05 20:16:21,603 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 832 transitions. Word has length 49 [2025-02-05 20:16:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:21,603 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 832 transitions. [2025-02-05 20:16:21,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-05 20:16:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 832 transitions. [2025-02-05 20:16:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 20:16:21,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:21,604 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] [2025-02-05 20:16:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:16:21,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 427364666, now seen corresponding path program 1 times [2025-02-05 20:16:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531714418] [2025-02-05 20:16:21,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:21,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:21,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:16:21,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:16:21,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:21,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:21,829 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-05 20:16:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531714418] [2025-02-05 20:16:21,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531714418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:21,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586253462] [2025-02-05 20:16:21,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:21,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:21,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:21,834 INFO L87 Difference]: Start difference. First operand 561 states and 832 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-05 20:16:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:22,208 INFO L93 Difference]: Finished difference Result 1070 states and 1587 transitions. [2025-02-05 20:16:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2025-02-05 20:16:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:22,210 INFO L225 Difference]: With dead ends: 1070 [2025-02-05 20:16:22,210 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 20:16:22,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:22,212 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 777 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:22,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1908 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 20:16:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2025-02-05 20:16:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4857142857142858) internal successors, (832), 560 states have internal predecessors, (832), 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-05 20:16:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 832 transitions. [2025-02-05 20:16:22,221 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 832 transitions. Word has length 50 [2025-02-05 20:16:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:22,221 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 832 transitions. [2025-02-05 20:16:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-05 20:16:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 832 transitions. [2025-02-05 20:16:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 20:16:22,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:22,222 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] [2025-02-05 20:16:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:16:22,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1468261192, now seen corresponding path program 1 times [2025-02-05 20:16:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243069917] [2025-02-05 20:16:22,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:16:22,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:16:22,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:22,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:16:22,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:16:22,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 20:16:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 20:16:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:16:22,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:16:22,365 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:16:22,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:16:22,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:16:22,370 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:22,414 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:16:22,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:16:22,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:16:22 BoogieIcfgContainer [2025-02-05 20:16:22,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:16:22,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:16:22,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:16:22,429 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:16:22,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:16" (3/4) ... [2025-02-05 20:16:22,435 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:16:22,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:16:22,436 INFO L158 Benchmark]: Toolchain (without parser) took 8808.68ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 113.1MB in the beginning and 205.1MB in the end (delta: -92.0MB). Peak memory consumption was 136.0MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,436 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:16:22,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.11ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 69.8MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 217.20ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 77.0MB in the end (delta: -8.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,436 INFO L158 Benchmark]: Boogie Preprocessor took 264.23ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 78.1MB in the end (delta: -1.1MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,437 INFO L158 Benchmark]: IcfgBuilder took 2084.31ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 77.5MB in the beginning and 135.6MB in the end (delta: -58.1MB). Peak memory consumption was 176.0MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,437 INFO L158 Benchmark]: TraceAbstraction took 5732.23ms. Allocated memory was 285.2MB in the beginning and 369.1MB in the end (delta: 83.9MB). Free memory was 135.6MB in the beginning and 205.1MB in the end (delta: -69.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-05 20:16:22,437 INFO L158 Benchmark]: Witness Printer took 6.38ms. Allocated memory is still 369.1MB. Free memory was 205.1MB in the beginning and 205.1MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:16:22,438 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.11ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 69.8MB in the end (delta: 43.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 217.20ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 77.0MB in the end (delta: -8.0MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 264.23ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 78.1MB in the end (delta: -1.1MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2084.31ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 77.5MB in the beginning and 135.6MB in the end (delta: -58.1MB). Peak memory consumption was 176.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5732.23ms. Allocated memory was 285.2MB in the beginning and 369.1MB in the end (delta: 83.9MB). Free memory was 135.6MB in the beginning and 205.1MB in the end (delta: -69.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 6.38ms. Allocated memory is still 369.1MB. Free memory was 205.1MB in the beginning and 205.1MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 175, overapproximation of bitwiseAnd at line 180. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_20 mask_SORT_20 = (SORT_20)-1 >> (sizeof(SORT_20) * 8 - 2); [L39] const SORT_20 msb_SORT_20 = (SORT_20)1 << (2 - 1); [L41] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 4); [L42] const SORT_85 msb_SORT_85 = (SORT_85)1 << (4 - 1); [L44] const SORT_150 mask_SORT_150 = (SORT_150)-1 >> (sizeof(SORT_150) * 8 - 32); [L45] const SORT_150 msb_SORT_150 = (SORT_150)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_7 var_11 = 4; [L49] const SORT_5 var_13 = 0; [L50] const SORT_7 var_17 = 2; [L51] const SORT_20 var_22 = 0; [L52] const SORT_3 var_26 = 0; [L53] const SORT_1 var_35 = 1; [L54] const SORT_1 var_43 = 0; [L55] const SORT_7 var_60 = 1; [L56] const SORT_7 var_66 = 5; [L57] const SORT_7 var_70 = 3; [L58] const SORT_7 var_102 = 7; [L59] const SORT_7 var_107 = 6; [L60] const SORT_150 var_152 = 0; [L61] const SORT_3 var_167 = 2; [L62] const SORT_3 var_184 = 31; [L64] SORT_1 input_2; [L65] SORT_3 input_4; [L66] SORT_5 input_6; [L67] SORT_3 input_173; [L68] SORT_3 input_174; [L69] SORT_3 input_175; [L70] SORT_3 input_183; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_195; [L74] SORT_3 input_198; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_219; [L78] SORT_3 input_222; [L79] SORT_3 input_224; [L80] SORT_20 input_238; [L81] SORT_20 input_239; [L82] SORT_20 input_240; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L84] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L85] SORT_5 state_14 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L90] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L91] SORT_3 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L92] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L93] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L94] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L95] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, var_102=7, var_107=6, var_11=4, var_13=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L96] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L98] SORT_7 init_10_arg_1 = var_8; [L99] state_9 = init_10_arg_1 [L100] SORT_5 init_15_arg_1 = var_13; [L101] state_14 = init_15_arg_1 [L102] SORT_3 init_28_arg_1 = var_26; [L103] state_27 = init_28_arg_1 [L104] SORT_3 init_30_arg_1 = var_26; [L105] state_29 = init_30_arg_1 [L106] SORT_3 init_40_arg_1 = var_26; [L107] state_39 = init_40_arg_1 [L108] SORT_3 init_42_arg_1 = var_26; [L109] state_41 = init_42_arg_1 [L110] SORT_1 init_45_arg_1 = var_43; [L111] state_44 = init_45_arg_1 [L112] SORT_3 init_47_arg_1 = var_26; [L113] state_46 = init_47_arg_1 [L114] SORT_3 init_49_arg_1 = var_26; [L115] state_48 = init_49_arg_1 [L116] SORT_3 init_51_arg_1 = var_26; [L117] state_50 = init_51_arg_1 [L118] SORT_3 init_53_arg_1 = var_26; [L119] state_52 = init_53_arg_1 [L120] SORT_3 init_55_arg_1 = var_26; [L121] state_54 = init_55_arg_1 [L122] SORT_3 init_57_arg_1 = var_26; [L123] state_56 = init_57_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L126] input_2 = __VERIFIER_nondet_uchar() [L127] input_4 = __VERIFIER_nondet_uchar() [L128] input_6 = __VERIFIER_nondet_ushort() [L129] input_173 = __VERIFIER_nondet_uchar() [L130] input_174 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_183 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_195 = __VERIFIER_nondet_uchar() [L136] input_198 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_219 = __VERIFIER_nondet_uchar() [L140] input_222 = __VERIFIER_nondet_uchar() [L141] input_224 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L144] input_240 = __VERIFIER_nondet_uchar() [L147] SORT_7 var_12_arg_0 = state_9; [L148] SORT_7 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_5 var_16_arg_0 = state_14; [L151] SORT_7 var_16 = var_16_arg_0 >> 9; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] EXPR var_16 & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_12=0, var_152=0, var_167=2, var_17=2, var_184=31, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L152] var_16 = var_16 & mask_SORT_7 [L153] SORT_7 var_18_arg_0 = var_16; [L154] SORT_7 var_18_arg_1 = var_17; [L155] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L156] SORT_1 var_19_arg_0 = var_12; [L157] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19_arg_0=0, var_19_arg_1=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L158] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L159] SORT_5 var_21_arg_0 = state_14; [L160] SORT_20 var_21 = var_21_arg_0 >> 7; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_21=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] EXPR var_21 & mask_SORT_20 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_19=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L161] var_21 = var_21 & mask_SORT_20 [L162] SORT_20 var_23_arg_0 = var_21; [L163] SORT_20 var_23_arg_1 = var_22; [L164] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L165] SORT_1 var_24_arg_0 = var_19; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] SORT_1 var_25_arg_0 = var_24; [L169] SORT_1 var_25 = ~var_25_arg_0; [L170] SORT_3 var_31_arg_0 = state_27; [L171] SORT_3 var_31_arg_1 = state_29; [L172] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L173] SORT_1 var_32_arg_0 = var_25; [L174] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L175] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L176] SORT_1 var_36_arg_0 = var_32; [L177] SORT_1 var_36 = ~var_36_arg_0; [L178] SORT_1 var_37_arg_0 = var_35; [L179] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L180] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L181] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_20=3, mask_SORT_3=31, mask_SORT_7=7, mask_SORT_85=15, state_14=0, state_27=0, state_29=0, state_39=0, state_41=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_9=0, var_102=7, var_107=6, var_11=4, var_152=0, var_167=2, var_16=0, var_17=2, var_184=31, var_18=0, var_22=0, var_26=0, var_35=1, var_43=0, var_60=1, var_66=5, var_70=3, var_8=0] [L181] var_37 = var_37 & mask_SORT_1 [L182] SORT_1 bad_38_arg_0 = var_37; [L183] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 543 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2341 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2341 mSDsluCounter, 19246 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13921 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4157 IncrementalHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 5325 mSDtfsCounter, 4157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-05 20:16:22,467 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.vis_arrays_vsaR_p15.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 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:16:24,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:16:24,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:16:24,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:16:24,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:16:24,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:16:24,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:16:24,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:16:24,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:16:24,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:16:24,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:16:24,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:16:24,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:16:24,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:16:24,624 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:16:24,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:16:24,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:16:24,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:16:24,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:24,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:16:24,625 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:16:24,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:16:24,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:16:24,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:16:24,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:16:24,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:16:24,626 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 -> 52bb3902ccaac92ca995ec60bcedc54784c82a6cab90a6a11e201a4e0de664cb [2025-02-05 20:16:24,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:16:24,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:16:24,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:16:24,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:16:24,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:16:24,903 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.vis_arrays_vsaR_p15.c [2025-02-05 20:16:26,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23a2e5585/8558b6a3b0264a368f3688392775b084/FLAGd5922fefd [2025-02-05 20:16:26,366 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:16:26,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-05 20:16:26,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23a2e5585/8558b6a3b0264a368f3688392775b084/FLAGd5922fefd [2025-02-05 20:16:26,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23a2e5585/8558b6a3b0264a368f3688392775b084 [2025-02-05 20:16:26,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:16:26,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:16:26,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:26,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:16:26,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:16:26,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:26,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b33bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26, skipping insertion in model container [2025-02-05 20:16:26,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:26,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:16:26,621 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-05 20:16:26,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:26,822 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:16:26,829 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.vis_arrays_vsaR_p15.c[1259,1272] [2025-02-05 20:16:26,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:26,908 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:16:26,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26 WrapperNode [2025-02-05 20:16:26,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:26,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:26,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:16:26,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:16:26,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:26,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,001 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2025-02-05 20:16:27,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:27,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:16:27,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:16:27,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:16:27,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,047 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-05 20:16:27,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:16:27,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:16:27,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:16:27,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:16:27,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (1/1) ... [2025-02-05 20:16:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:27,159 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-05 20:16:27,161 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-05 20:16:27,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:16:27,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:16:27,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:16:27,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:16:27,383 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:16:27,384 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:16:28,495 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-02-05 20:16:28,495 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:16:28,502 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:16:28,502 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:16:28,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:28 BoogieIcfgContainer [2025-02-05 20:16:28,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:16:28,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:16:28,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:16:28,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:16:28,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:16:26" (1/3) ... [2025-02-05 20:16:28,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd01d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:28, skipping insertion in model container [2025-02-05 20:16:28,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:26" (2/3) ... [2025-02-05 20:16:28,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd01d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:28, skipping insertion in model container [2025-02-05 20:16:28,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:28" (3/3) ... [2025-02-05 20:16:28,511 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c [2025-02-05 20:16:28,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:16:28,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p15.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:16:28,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:16:28,568 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;@3e89c976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:16:28,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:16:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:16:28,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:28,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:16:28,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:16:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:16:28,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521113839] [2025-02-05 20:16:28,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:28,593 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-05 20:16:28,598 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-05 20:16:28,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:16:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:16:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:28,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:28,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 20:16:28,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:16:28,940 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-05 20:16:28,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:16:28,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:16:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521113839] [2025-02-05 20:16:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521113839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405076024] [2025-02-05 20:16:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:16:28,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:28,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:28,975 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:29,028 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:16:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:29,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 20:16:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:29,034 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:16:29,034 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:16:29,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:29,037 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:29,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:16:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:16:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:16:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:16:29,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:16:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:29,065 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:16:29,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:16:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:16:29,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:29,066 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:29,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:16:29,270 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-05 20:16:29,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:16:29,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:16:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976258273] [2025-02-05 20:16:29,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:29,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:29,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:29,277 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-05 20:16:29,279 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-05 20:16:29,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:16:29,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:16:29,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:29,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:29,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 20:16:29,600 INFO L279 TraceCheckSpWp]: Computing forward predicates...