./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:38:25,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:38:25,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:38:25,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:38:25,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:38:25,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:38:25,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:38:25,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:38:25,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:38:25,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:38:25,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:38:25,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:38:25,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:38:25,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:38:25,371 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:38:25,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:38:25,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:38:25,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:38:25,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:38:25,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:38:25,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c [2025-03-08 09:38:25,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:38:25,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:38:25,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:38:25,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:38:25,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:38:25,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:26,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4179b20ac/c219478d39474cff81382b3a4bba751f/FLAGfda8dc960 [2025-03-08 09:38:27,023 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:38:27,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:27,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4179b20ac/c219478d39474cff81382b3a4bba751f/FLAGfda8dc960 [2025-03-08 09:38:27,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4179b20ac/c219478d39474cff81382b3a4bba751f [2025-03-08 09:38:27,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:38:27,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:38:27,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:27,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:38:27,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:38:27,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6190a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27, skipping insertion in model container [2025-03-08 09:38:27,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:38:27,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2025-03-08 09:38:27,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:27,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:38:27,277 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2025-03-08 09:38:27,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:27,335 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:38:27,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27 WrapperNode [2025-03-08 09:38:27,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:27,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:27,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:38:27,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:38:27,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,410 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 772 [2025-03-08 09:38:27,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:27,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:38:27,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:38:27,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:38:27,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:38:27,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:38:27,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:38:27,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:38:27,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:38:27,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (1/1) ... [2025-03-08 09:38:27,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:38:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:27,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:38:27,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:38:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:38:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:38:27,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:38:27,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:38:27,691 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:38:27,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:38:28,409 INFO L? ?]: Removed 411 outVars from TransFormulas that were not future-live. [2025-03-08 09:38:28,409 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:38:28,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:38:28,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:38:28,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:28 BoogieIcfgContainer [2025-03-08 09:38:28,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:38:28,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:38:28,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:38:28,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:38:28,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:38:27" (1/3) ... [2025-03-08 09:38:28,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d18e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:28, skipping insertion in model container [2025-03-08 09:38:28,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:27" (2/3) ... [2025-03-08 09:38:28,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d18e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:28, skipping insertion in model container [2025-03-08 09:38:28,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:28" (3/3) ... [2025-03-08 09:38:28,448 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:28,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:38:28,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c that has 1 procedures, 146 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:38:28,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:38:28,514 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;@1521f9b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:38:28,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:38:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 145 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 09:38:28,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:28,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:28,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:28,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1191523876, now seen corresponding path program 1 times [2025-03-08 09:38:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550586325] [2025-03-08 09:38:28,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:28,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 09:38:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 09:38:28,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550586325] [2025-03-08 09:38:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550586325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:38:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690492308] [2025-03-08 09:38:29,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:38:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:29,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:38:29,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:29,110 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 145 states have internal predecessors, (215), 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 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:29,238 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2025-03-08 09:38:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:38:29,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-08 09:38:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:29,246 INFO L225 Difference]: With dead ends: 233 [2025-03-08 09:38:29,247 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 09:38:29,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:29,252 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:29,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:38:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 09:38:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 09:38:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4791666666666667) internal successors, (213), 144 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2025-03-08 09:38:29,286 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 213 transitions. Word has length 43 [2025-03-08 09:38:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:29,286 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 213 transitions. [2025-03-08 09:38:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 213 transitions. [2025-03-08 09:38:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 09:38:29,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:29,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:29,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:38:29,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:29,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1722144758, now seen corresponding path program 1 times [2025-03-08 09:38:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325932213] [2025-03-08 09:38:29,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:29,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 09:38:29,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 09:38:29,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:29,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:29,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325932213] [2025-03-08 09:38:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325932213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:38:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873911753] [2025-03-08 09:38:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:38:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:38:29,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:29,457 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:29,551 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2025-03-08 09:38:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:38:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 09:38:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:29,554 INFO L225 Difference]: With dead ends: 234 [2025-03-08 09:38:29,554 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 09:38:29,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:29,555 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:29,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:38:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 09:38:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 09:38:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 146 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 215 transitions. [2025-03-08 09:38:29,562 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 215 transitions. Word has length 44 [2025-03-08 09:38:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 215 transitions. [2025-03-08 09:38:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2025-03-08 09:38:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 09:38:29,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:29,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:29,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:38:29,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:29,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:29,568 INFO L85 PathProgramCache]: Analyzing trace with hash -516578025, now seen corresponding path program 1 times [2025-03-08 09:38:29,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:29,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581710525] [2025-03-08 09:38:29,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 09:38:29,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 09:38:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:29,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581710525] [2025-03-08 09:38:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581710525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:38:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109122100] [2025-03-08 09:38:29,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:29,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:38:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:29,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:38:29,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:38:29,918 INFO L87 Difference]: Start difference. First operand 147 states and 215 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:30,103 INFO L93 Difference]: Finished difference Result 240 states and 350 transitions. [2025-03-08 09:38:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:38:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 09:38:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:30,104 INFO L225 Difference]: With dead ends: 240 [2025-03-08 09:38:30,104 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 09:38:30,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:38:30,105 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 182 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:30,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 628 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:38:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 09:38:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-03-08 09:38:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4630872483221478) internal successors, (218), 149 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2025-03-08 09:38:30,117 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 45 [2025-03-08 09:38:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:30,117 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2025-03-08 09:38:30,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2025-03-08 09:38:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 09:38:30,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:30,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:38:30,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1151547534, now seen corresponding path program 1 times [2025-03-08 09:38:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831508198] [2025-03-08 09:38:30,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:30,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 09:38:30,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 09:38:30,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:30,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:38:30,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:38:30,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 09:38:30,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 09:38:30,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:30,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:38:30,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:38:30,233 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:38:30,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:38:30,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:38:30,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:38:30,263 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:38:30,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:38:30,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:38:30 BoogieIcfgContainer [2025-03-08 09:38:30,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:38:30,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:38:30,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:38:30,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:38:30,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:28" (3/4) ... [2025-03-08 09:38:30,283 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:38:30,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:38:30,284 INFO L158 Benchmark]: Toolchain (without parser) took 3218.79ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.7MB in the beginning and 239.1MB in the end (delta: -115.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-03-08 09:38:30,285 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:38:30,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.24ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 102.0MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:38:30,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.23ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 87.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:38:30,285 INFO L158 Benchmark]: Boogie Preprocessor took 99.64ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 79.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:38:30,285 INFO L158 Benchmark]: IcfgBuilder took 927.78ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 71.7MB in the end (delta: 7.9MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-03-08 09:38:30,286 INFO L158 Benchmark]: TraceAbstraction took 1836.40ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 71.7MB in the beginning and 239.1MB in the end (delta: -167.5MB). Peak memory consumption was 57.8kB. Max. memory is 16.1GB. [2025-03-08 09:38:30,286 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 335.5MB. Free memory was 239.1MB in the beginning and 239.1MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:38:30,287 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.53ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.24ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 102.0MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.23ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 87.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.64ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 79.5MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 927.78ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 71.7MB in the end (delta: 7.9MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1836.40ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 71.7MB in the beginning and 239.1MB in the end (delta: -167.5MB). Peak memory consumption was 57.8kB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 335.5MB. Free memory was 239.1MB in the beginning and 239.1MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 173. 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 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_67 var_68 = 0; [L45] const SORT_10 var_122 = 104; [L46] const SORT_10 var_145 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_31 input_34; [L55] SORT_1 input_36; [L56] SORT_1 input_42; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_3 input_50; [L60] SORT_1 input_53; [L61] SORT_1 input_63; [L62] SORT_1 input_73; [L63] SORT_1 input_79; [L64] SORT_1 input_80; [L65] SORT_1 input_91; [L66] SORT_1 input_98; [L67] SORT_1 input_104; [L68] SORT_1 input_110; [L69] SORT_1 input_116; [L70] SORT_1 input_117; [L71] SORT_1 input_118; [L72] SORT_1 input_135; [L73] SORT_67 input_143; [L74] SORT_1 input_152; [L75] SORT_1 input_153; [L76] SORT_1 input_154; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L78] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L79] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L80] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L81] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L82] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L83] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L84] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L85] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L87] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L88] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L89] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_67 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L90] SORT_67 state_69 = __VERIFIER_nondet_ushort() & mask_SORT_67; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L91] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] SORT_1 init_9_arg_1 = var_7; [L94] state_8 = init_9_arg_1 [L95] SORT_1 init_15_arg_1 = var_7; [L96] state_14 = init_15_arg_1 [L97] SORT_1 init_26_arg_1 = var_7; [L98] state_25 = init_26_arg_1 [L99] SORT_1 init_28_arg_1 = var_7; [L100] state_27 = init_28_arg_1 [L101] SORT_1 init_39_arg_1 = var_7; [L102] state_38 = init_39_arg_1 [L103] SORT_1 init_41_arg_1 = var_7; [L104] state_40 = init_41_arg_1 [L105] SORT_1 init_49_arg_1 = var_21; [L106] state_48 = init_49_arg_1 [L107] SORT_1 init_56_arg_1 = var_7; [L108] state_55 = init_56_arg_1 [L109] SORT_1 init_58_arg_1 = var_7; [L110] state_57 = init_58_arg_1 [L111] SORT_1 init_60_arg_1 = var_7; [L112] state_59 = init_60_arg_1 [L113] SORT_1 init_62_arg_1 = var_7; [L114] state_61 = init_62_arg_1 [L115] SORT_1 init_66_arg_1 = var_7; [L116] state_65 = init_66_arg_1 [L117] SORT_67 init_70_arg_1 = var_68; [L118] state_69 = init_70_arg_1 [L119] SORT_1 init_72_arg_1 = var_7; [L120] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L123] input_2 = __VERIFIER_nondet_uchar() [L124] input_4 = __VERIFIER_nondet_uchar() [L125] input_5 = __VERIFIER_nondet_uchar() [L126] input_6 = __VERIFIER_nondet_uchar() [L127] input_29 = __VERIFIER_nondet_uchar() [L128] input_32 = __VERIFIER_nondet_uchar() [L129] input_34 = __VERIFIER_nondet_uchar() [L130] input_36 = __VERIFIER_nondet_uchar() [L131] input_42 = __VERIFIER_nondet_uchar() [L132] input_44 = __VERIFIER_nondet_uchar() [L133] input_46 = __VERIFIER_nondet_uchar() [L134] input_50 = __VERIFIER_nondet_uchar() [L135] input_53 = __VERIFIER_nondet_uchar() [L136] input_63 = __VERIFIER_nondet_uchar() [L137] input_73 = __VERIFIER_nondet_uchar() [L138] input_79 = __VERIFIER_nondet_uchar() [L139] input_80 = __VERIFIER_nondet_uchar() [L140] input_91 = __VERIFIER_nondet_uchar() [L141] input_98 = __VERIFIER_nondet_uchar() [L142] input_104 = __VERIFIER_nondet_uchar() [L143] input_110 = __VERIFIER_nondet_uchar() [L144] input_116 = __VERIFIER_nondet_uchar() [L145] input_117 = __VERIFIER_nondet_uchar() [L146] input_118 = __VERIFIER_nondet_uchar() [L147] input_135 = __VERIFIER_nondet_uchar() [L148] input_143 = __VERIFIER_nondet_ushort() [L149] input_152 = __VERIFIER_nondet_uchar() [L150] input_153 = __VERIFIER_nondet_uchar() [L151] input_154 = __VERIFIER_nondet_uchar() [L154] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_11_arg_0=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L155] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L155] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L156] SORT_10 var_11 = var_11_arg_0; [L157] SORT_10 var_13_arg_0 = var_11; [L158] SORT_10 var_13_arg_1 = var_12; [L159] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L160] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_13=1, var_145=1, var_16_arg_0=0, var_21=1, var_68=0, var_7=0] [L161] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_13=1, var_145=1, var_21=1, var_68=0, var_7=0] [L161] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L162] SORT_10 var_16 = var_16_arg_0; [L163] SORT_10 var_17_arg_0 = var_16; [L164] SORT_10 var_17_arg_1 = var_12; [L165] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L166] SORT_1 var_18_arg_0 = var_13; [L167] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_68=0, var_7=0] [L168] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L168] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L169] SORT_1 var_22_arg_0 = var_18; [L170] SORT_1 var_22 = ~var_22_arg_0; [L171] SORT_1 var_23_arg_0 = var_21; [L172] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_68=0, var_7=0] [L173] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L173] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L174] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_67=1023, state_14=0, state_25=0, state_27=0, state_38=0, state_40=0, state_48=1, state_55=0, state_57=0, state_59=0, state_61=0, state_65=0, state_69=0, state_71=0, state_8=0, var_122=104, var_12=0, var_145=1, var_21=1, var_68=0, var_7=0] [L174] var_23 = var_23 & mask_SORT_1 [L175] SORT_1 bad_24_arg_0 = var_23; [L176] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 215 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 1665 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1156 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 509 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 09:38:30,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:38:32,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:38:32,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:38:32,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:38:32,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:38:32,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:38:32,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:38:32,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:38:32,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:38:32,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:38:32,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:38:32,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:38:32,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:38:32,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:38:32,203 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:38:32,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:38:32,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:38:32,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:38:32,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:38:32,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:38:32,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:38:32,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:38:32,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:38:32,206 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:38:32,207 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be98390aa39eb4015bb82c52f3543b0d6ba9e6d709277c1c8e88d4773e2b528c [2025-03-08 09:38:32,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:38:32,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:38:32,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:38:32,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:38:32,476 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:38:32,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:33,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87171d6/d07c6ef648884e4eb0d132f0aa739895/FLAG1d39139ca [2025-03-08 09:38:33,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:38:33,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:33,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87171d6/d07c6ef648884e4eb0d132f0aa739895/FLAG1d39139ca [2025-03-08 09:38:34,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87171d6/d07c6ef648884e4eb0d132f0aa739895 [2025-03-08 09:38:34,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:38:34,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:38:34,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:34,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:38:34,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:38:34,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6614f638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34, skipping insertion in model container [2025-03-08 09:38:34,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:38:34,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2025-03-08 09:38:34,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:34,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:38:34,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c[1266,1279] [2025-03-08 09:38:34,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:34,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:38:34,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34 WrapperNode [2025-03-08 09:38:34,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:34,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:34,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:38:34,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:38:34,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,517 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 500 [2025-03-08 09:38:34,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:34,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:38:34,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:38:34,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:38:34,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:38:34,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:38:34,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:38:34,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:38:34,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:38:34,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (1/1) ... [2025-03-08 09:38:34,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:38:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:34,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:38:34,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:38:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:38:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:38:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:38:34,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:38:34,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:38:34,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:38:35,038 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-08 09:38:35,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:38:35,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:38:35,057 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:38:35,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:35 BoogieIcfgContainer [2025-03-08 09:38:35,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:38:35,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:38:35,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:38:35,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:38:35,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:38:34" (1/3) ... [2025-03-08 09:38:35,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e8f908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:35, skipping insertion in model container [2025-03-08 09:38:35,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:34" (2/3) ... [2025-03-08 09:38:35,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e8f908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:35, skipping insertion in model container [2025-03-08 09:38:35,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:35" (3/3) ... [2025-03-08 09:38:35,064 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c [2025-03-08 09:38:35,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:38:35,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p11.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:38:35,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:38:35,116 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;@46cee9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:38:35,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:38:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:38:35,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:35,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:38:35,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:38:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280300547] [2025-03-08 09:38:35,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:35,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:35,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:35,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:38:35,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:38:35,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:38:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:35,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 09:38:35,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:35,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:38:35,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280300547] [2025-03-08 09:38:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280300547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:38:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864513750] [2025-03-08 09:38:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:38:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:35,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:38:35,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:35,417 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:35,464 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:38:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:38:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 09:38:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:35,471 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:38:35,471 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:38:35,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:38:35,476 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:35,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:38:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:38:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:38:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:38:35,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:38:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:35,502 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:38:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:38:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:38:35,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:35,503 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:35,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:38:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:35,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:38:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437899266] [2025-03-08 09:38:35,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:35,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:35,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:38:35,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:38:35,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:38:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:35,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 09:38:35,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:36,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:36,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437899266] [2025-03-08 09:38:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437899266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:36,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:38:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 09:38:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158190530] [2025-03-08 09:38:36,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:38:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:36,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:38:36,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:38:36,744 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:36,856 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 09:38:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:38:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 09:38:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:36,857 INFO L225 Difference]: With dead ends: 15 [2025-03-08 09:38:36,857 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 09:38:36,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:38:36,858 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:36,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:38:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 09:38:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-08 09:38:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 09:38:36,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 09:38:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 09:38:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 09:38:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 09:38:36,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:36,861 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-08 09:38:36,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:38:37,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:37,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:37,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-08 09:38:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031617796] [2025-03-08 09:38:37,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:38:37,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:37,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:37,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:37,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:38:37,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 09:38:37,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 09:38:37,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:38:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:37,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 09:38:37,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:50,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:39:44,926 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)