./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.swap_three.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 a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:37:09,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:37:09,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:37:09,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:37:09,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:37:09,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:37:09,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:37:09,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:37:09,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:37:09,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:37:09,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:37:09,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:37:09,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:37:09,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:37:09,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:37:09,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:37:09,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:37:09,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:09,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:37:09,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:37:09,982 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 -> a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d [2025-03-16 22:37:10,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:37:10,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:37:10,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:37:10,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:37:10,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:37:10,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2025-03-16 22:37:11,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df1b4175/06c035d8255e4bbe903ce149329d8976/FLAGd9f8b1b18 [2025-03-16 22:37:11,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:37:11,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2025-03-16 22:37:11,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df1b4175/06c035d8255e4bbe903ce149329d8976/FLAGd9f8b1b18 [2025-03-16 22:37:11,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df1b4175/06c035d8255e4bbe903ce149329d8976 [2025-03-16 22:37:11,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:37:11,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:37:11,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:11,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:37:11,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:37:11,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11, skipping insertion in model container [2025-03-16 22:37:11,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:37:11,778 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.swap_three.c[1250,1263] [2025-03-16 22:37:11,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:11,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:37:11,823 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.swap_three.c[1250,1263] [2025-03-16 22:37:11,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:11,856 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:37:11,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11 WrapperNode [2025-03-16 22:37:11,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:11,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:11,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:37:11,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:37:11,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,883 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 172 [2025-03-16 22:37:11,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:11,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:37:11,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:37:11,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:37:11,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,909 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-16 22:37:11,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:37:11,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:37:11,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:37:11,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:37:11,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (1/1) ... [2025-03-16 22:37:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:11,949 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-16 22:37:11,953 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-16 22:37:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:37:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:37:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:37:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:37:12,024 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:37:12,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:37:12,309 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-16 22:37:12,310 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:37:12,332 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:37:12,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:37:12,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:12 BoogieIcfgContainer [2025-03-16 22:37:12,333 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:37:12,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:37:12,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:37:12,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:37:12,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:37:11" (1/3) ... [2025-03-16 22:37:12,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d90919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:12, skipping insertion in model container [2025-03-16 22:37:12,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:11" (2/3) ... [2025-03-16 22:37:12,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d90919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:12, skipping insertion in model container [2025-03-16 22:37:12,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:12" (3/3) ... [2025-03-16 22:37:12,341 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2025-03-16 22:37:12,352 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:37:12,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.swap_three.c that has 1 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:37:12,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:37:12,402 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;@6bccbefc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:37:12,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:37:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 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-16 22:37:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 22:37:12,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:12,411 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] [2025-03-16 22:37:12,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:12,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 701459750, now seen corresponding path program 1 times [2025-03-16 22:37:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:12,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939638601] [2025-03-16 22:37:12,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:12,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 22:37:12,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 22:37:12,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:12,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:12,900 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-16 22:37:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939638601] [2025-03-16 22:37:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939638601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:12,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927379] [2025-03-16 22:37:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:12,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:37:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:12,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:37:12,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:12,921 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 22:37:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:12,971 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2025-03-16 22:37:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:12,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-16 22:37:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:12,978 INFO L225 Difference]: With dead ends: 83 [2025-03-16 22:37:12,978 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 22:37:12,980 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-16 22:37:12,983 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:12,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:37:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 22:37:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 22:37:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 22:37:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-16 22:37:13,006 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 24 [2025-03-16 22:37:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-16 22:37:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 22:37:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-16 22:37:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 22:37:13,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,007 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] [2025-03-16 22:37:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:37:13,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,007 INFO L85 PathProgramCache]: Analyzing trace with hash 275094913, now seen corresponding path program 1 times [2025-03-16 22:37:13,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314573877] [2025-03-16 22:37:13,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 22:37:13,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 22:37:13,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:13,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:13,131 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-16 22:37:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314573877] [2025-03-16 22:37:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314573877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533173264] [2025-03-16 22:37:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:13,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:37:13,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:13,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:37:13,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:13,134 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 22:37:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,189 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2025-03-16 22:37:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-16 22:37:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,190 INFO L225 Difference]: With dead ends: 85 [2025-03-16 22:37:13,190 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 22:37:13,190 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-16 22:37:13,191 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:37:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 22:37:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 22:37:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 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-16 22:37:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-03-16 22:37:13,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 25 [2025-03-16 22:37:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,194 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-03-16 22:37:13,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 22:37:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-03-16 22:37:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 22:37:13,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,195 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] [2025-03-16 22:37:13,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:37:13,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1869516929, now seen corresponding path program 1 times [2025-03-16 22:37:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-03-16 22:37:13,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 22:37:13,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 22:37:13,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:13,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:13,414 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-16 22:37:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272200172] [2025-03-16 22:37:13,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272200172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:13,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:13,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979943869] [2025-03-16 22:37:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:13,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:13,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:13,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:13,415 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 22:37:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,583 INFO L93 Difference]: Finished difference Result 124 states and 172 transitions. [2025-03-16 22:37:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-16 22:37:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,585 INFO L225 Difference]: With dead ends: 124 [2025-03-16 22:37:13,585 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 22:37:13,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:13,586 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 105 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 22:37:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 53. [2025-03-16 22:37:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 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-16 22:37:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-16 22:37:13,590 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 26 [2025-03-16 22:37:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,591 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-16 22:37:13,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-16 22:37:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-16 22:37:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 22:37:13,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,591 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] [2025-03-16 22:37:13,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:37:13,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1438777467, now seen corresponding path program 1 times [2025-03-16 22:37:13,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-03-16 22:37:13,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 22:37:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 22:37:13,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:13,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:13,751 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-16 22:37:13,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:13,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-03-16 22:37:13,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042037699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:13,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:13,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328303696] [2025-03-16 22:37:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:13,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:13,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:13,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:13,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:13,752 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 22:37:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:13,878 INFO L93 Difference]: Finished difference Result 124 states and 170 transitions. [2025-03-16 22:37:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-16 22:37:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:13,880 INFO L225 Difference]: With dead ends: 124 [2025-03-16 22:37:13,880 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 22:37:13,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:13,881 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:13,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 173 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 22:37:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2025-03-16 22:37:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2025-03-16 22:37:13,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 28 [2025-03-16 22:37:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:13,889 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2025-03-16 22:37:13,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-16 22:37:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2025-03-16 22:37:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 22:37:13,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:13,891 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] [2025-03-16 22:37:13,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:37:13,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:13,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1709348315, now seen corresponding path program 1 times [2025-03-16 22:37:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:13,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525653412] [2025-03-16 22:37:13,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:13,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 22:37:13,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 22:37:13,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,035 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-16 22:37:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525653412] [2025-03-16 22:37:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525653412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:14,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825119936] [2025-03-16 22:37:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:14,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:14,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:14,037 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 22:37:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:14,137 INFO L93 Difference]: Finished difference Result 124 states and 169 transitions. [2025-03-16 22:37:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-16 22:37:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:14,138 INFO L225 Difference]: With dead ends: 124 [2025-03-16 22:37:14,138 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 22:37:14,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:37:14,139 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:14,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 22:37:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2025-03-16 22:37:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 22:37:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-16 22:37:14,146 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 29 [2025-03-16 22:37:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:14,147 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-16 22:37:14,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-16 22:37:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-16 22:37:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 22:37:14,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:14,147 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] [2025-03-16 22:37:14,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:37:14,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:14,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash 529265265, now seen corresponding path program 1 times [2025-03-16 22:37:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256807346] [2025-03-16 22:37:14,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:14,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 22:37:14,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 22:37:14,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,284 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-16 22:37:14,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256807346] [2025-03-16 22:37:14,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256807346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:14,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:14,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035962910] [2025-03-16 22:37:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:14,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:14,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:14,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:14,286 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 22:37:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:14,399 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2025-03-16 22:37:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:14,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 22:37:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:14,400 INFO L225 Difference]: With dead ends: 130 [2025-03-16 22:37:14,400 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 22:37:14,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:14,401 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:14,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 108 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 22:37:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2025-03-16 22:37:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 0 states have call successors, (0), 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-16 22:37:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2025-03-16 22:37:14,409 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 30 [2025-03-16 22:37:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:14,409 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2025-03-16 22:37:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-16 22:37:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2025-03-16 22:37:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 22:37:14,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:14,410 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] [2025-03-16 22:37:14,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:37:14,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:14,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash 435150777, now seen corresponding path program 1 times [2025-03-16 22:37:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-16 22:37:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:14,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 22:37:14,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 22:37:14,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,569 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-16 22:37:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418337586] [2025-03-16 22:37:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418337586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:37:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693636581] [2025-03-16 22:37:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:37:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:14,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:37:14,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:14,570 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 22:37:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:14,668 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2025-03-16 22:37:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:37:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-16 22:37:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:14,669 INFO L225 Difference]: With dead ends: 124 [2025-03-16 22:37:14,669 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 22:37:14,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:14,670 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 43 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:14,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 109 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 22:37:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2025-03-16 22:37:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 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-16 22:37:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2025-03-16 22:37:14,675 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 31 [2025-03-16 22:37:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:14,675 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2025-03-16 22:37:14,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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-16 22:37:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2025-03-16 22:37:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 22:37:14,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:14,677 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] [2025-03-16 22:37:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:37:14,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:14,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1348814501, now seen corresponding path program 1 times [2025-03-16 22:37:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866025533] [2025-03-16 22:37:14,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 22:37:14,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 22:37:14,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:14,849 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-16 22:37:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:37:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866025533] [2025-03-16 22:37:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866025533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:37:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912914822] [2025-03-16 22:37:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:14,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:37:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:37:14,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:37:14,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:37:14,851 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 22:37:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:14,914 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2025-03-16 22:37:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 22:37:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:14,916 INFO L225 Difference]: With dead ends: 106 [2025-03-16 22:37:14,917 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 22:37:14,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 22:37:14,918 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 50 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:14,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 188 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 22:37:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-16 22:37:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 0 states have call successors, (0), 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-16 22:37:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2025-03-16 22:37:14,924 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 32 [2025-03-16 22:37:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:14,924 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2025-03-16 22:37:14,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 22:37:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2025-03-16 22:37:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:37:14,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:14,925 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] [2025-03-16 22:37:14,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:37:14,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1084483540, now seen corresponding path program 1 times [2025-03-16 22:37:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:37:14,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-03-16 22:37:14,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:37:14,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:37:14,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:37:14,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:37:14,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:37:14,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:37:14,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:37:14,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:14,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:37:15,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:37:15,021 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:37:15,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:37:15,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:37:15,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:37:15,046 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:37:15,052 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:37:15,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:37:15 BoogieIcfgContainer [2025-03-16 22:37:15,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:37:15,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:37:15,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:37:15,054 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:37:15,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:12" (3/4) ... [2025-03-16 22:37:15,056 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:37:15,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:37:15,057 INFO L158 Benchmark]: Toolchain (without parser) took 3379.05ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.4MB in the beginning and 143.4MB in the end (delta: -33.0MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 192.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.95ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: IcfgBuilder took 409.59ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 69.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: TraceAbstraction took 2718.91ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.3MB in the beginning and 143.5MB in the end (delta: -74.2MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2025-03-16 22:37:15,057 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 143.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:15,058 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.23ms. Allocated memory is still 192.9MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.95ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 95.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 409.59ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 69.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2718.91ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.3MB in the beginning and 143.5MB in the end (delta: -74.2MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 143.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 78, overapproximation of bitwiseAnd at line 90, overapproximation of bitwiseAnd at line 63, overapproximation of bitwiseAnd at line 69. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 20); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (20 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_8 var_10 = 1; [L37] const SORT_8 var_13 = 5; [L38] const SORT_8 var_17 = 7; [L39] const SORT_1 var_22 = 1; [L40] const SORT_4 var_26 = 5; [L41] const SORT_4 var_29 = 7; [L43] SORT_1 input_2; [L44] SORT_1 input_3; [L46] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L46] SORT_4 state_6 = __VERIFIER_nondet_uint() & mask_SORT_4; [L47] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L47] SORT_4 state_27 = __VERIFIER_nondet_uint() & mask_SORT_4; [L48] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=1, var_13=5, var_17=7, var_22=1, var_26=5, var_29=7, var_5=1] [L48] SORT_4 state_30 = __VERIFIER_nondet_uint() & mask_SORT_4; [L50] SORT_4 init_7_arg_1 = var_5; [L51] state_6 = init_7_arg_1 [L52] SORT_4 init_28_arg_1 = var_26; [L53] state_27 = init_28_arg_1 [L54] SORT_4 init_31_arg_1 = var_29; [L55] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_9_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_9_arg_0=1] [L63] EXPR var_9_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L63] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L64] SORT_8 var_9 = var_9_arg_0; [L65] SORT_8 var_11_arg_0 = var_9; [L66] SORT_8 var_11_arg_1 = var_10; [L67] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L68] SORT_4 var_12_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_12_arg_0=1, var_13=5, var_17=7, var_22=1] [L69] EXPR var_12_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_11=0, var_13=5, var_17=7, var_22=1] [L69] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L70] SORT_8 var_12 = var_12_arg_0; [L71] SORT_8 var_14_arg_0 = var_12; [L72] SORT_8 var_14_arg_1 = var_13; [L73] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L74] SORT_1 var_15_arg_0 = var_11; [L75] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15_arg_0=0, var_15_arg_1=0, var_17=7, var_22=1] [L76] EXPR var_15_arg_0 | var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L76] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L77] SORT_4 var_16_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15=0, var_16_arg_0=1, var_17=7, var_22=1] [L78] EXPR var_16_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_15=0, var_17=7, var_22=1] [L78] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L79] SORT_8 var_16 = var_16_arg_0; [L80] SORT_8 var_18_arg_0 = var_16; [L81] SORT_8 var_18_arg_1 = var_17; [L82] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L83] SORT_1 var_19_arg_0 = var_15; [L84] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_19_arg_0=0, var_19_arg_1=0, var_22=1] [L85] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L85] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L86] SORT_1 var_23_arg_0 = var_19; [L87] SORT_1 var_23 = ~var_23_arg_0; [L88] SORT_1 var_24_arg_0 = var_22; [L89] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1, var_24_arg_0=1, var_24_arg_1=-1] [L90] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L90] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L91] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_27=5, state_30=7, state_6=1, var_10=1, var_13=5, var_17=7, var_22=1] [L91] var_24 = var_24 & mask_SORT_1 [L92] SORT_1 bad_25_arg_0 = var_24; [L93] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 1169 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 831 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 842 IncrementalHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 338 mSDtfsCounter, 842 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 134 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:37:15,069 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.swap_three.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 a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:37:16,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:37:16,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:37:16,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:37:16,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:37:16,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:37:16,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:37:16,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:37:16,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:37:16,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:37:16,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:37:16,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:37:16,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:37:16,948 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:37:16,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:16,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:37:16,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:37:16,949 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 -> a995c16e34c6a8c947423a8daf73fb5637408e6de846a052a4473f47c82db47d [2025-03-16 22:37:17,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:37:17,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:37:17,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:37:17,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:37:17,190 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:37:17,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2025-03-16 22:37:18,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57cf62fd/1c8d75c311944d19b8157faeb3703b99/FLAGc1267d57c [2025-03-16 22:37:18,513 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:37:18,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2025-03-16 22:37:18,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57cf62fd/1c8d75c311944d19b8157faeb3703b99/FLAGc1267d57c [2025-03-16 22:37:18,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57cf62fd/1c8d75c311944d19b8157faeb3703b99 [2025-03-16 22:37:18,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:37:18,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:37:18,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:18,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:37:18,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:37:18,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:18" (1/1) ... [2025-03-16 22:37:18,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733308c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:18, skipping insertion in model container [2025-03-16 22:37:18,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:37:18" (1/1) ... [2025-03-16 22:37:18,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:37:18,994 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.swap_three.c[1250,1263] [2025-03-16 22:37:19,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:19,021 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:37:19,028 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.swap_three.c[1250,1263] [2025-03-16 22:37:19,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:37:19,047 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:37:19,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19 WrapperNode [2025-03-16 22:37:19,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:37:19,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:19,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:37:19,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:37:19,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,069 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2025-03-16 22:37:19,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:37:19,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:37:19,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:37:19,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:37:19,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,092 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-16 22:37:19,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:37:19,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:37:19,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:37:19,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:37:19,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (1/1) ... [2025-03-16 22:37:19,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:37:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:19,132 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-16 22:37:19,135 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-16 22:37:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:37:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:37:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:37:19,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:37:19,216 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:37:19,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:37:19,344 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-16 22:37:19,344 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:37:19,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:37:19,351 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:37:19,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:19 BoogieIcfgContainer [2025-03-16 22:37:19,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:37:19,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:37:19,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:37:19,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:37:19,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:37:18" (1/3) ... [2025-03-16 22:37:19,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@816a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:19, skipping insertion in model container [2025-03-16 22:37:19,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:37:19" (2/3) ... [2025-03-16 22:37:19,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@816a4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:37:19, skipping insertion in model container [2025-03-16 22:37:19,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:19" (3/3) ... [2025-03-16 22:37:19,360 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2025-03-16 22:37:19,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:37:19,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.swap_three.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:37:19,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:37:19,407 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;@59b4203, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:37:19,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:37:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:37:19,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:19,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:37:19,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:37:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:37:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325671888] [2025-03-16 22:37:19,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:19,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:19,427 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-16 22:37:19,429 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-16 22:37:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:37:19,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:37:19,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:19,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:19,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 22:37:19,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:19,702 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-16 22:37:19,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:37:19,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:37:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325671888] [2025-03-16 22:37:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325671888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:37:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:37:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:37:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837487926] [2025-03-16 22:37:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:37:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:37:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:37:19,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:37:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:37:19,721 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:19,760 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:37:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 22:37:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:19,766 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:37:19,766 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:37:19,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:37:19,769 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:19,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:37:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:37:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:37:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:37:19,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:37:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:19,791 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:37:19,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:37:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:37:19,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:19,791 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:37:19,798 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-16 22:37:19,992 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-16 22:37:19,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:37:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:37:19,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562900795] [2025-03-16 22:37:19,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:37:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:19,995 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-16 22:37:19,996 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-16 22:37:20,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:37:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:37:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:37:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:20,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 22:37:20,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:20,236 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-16 22:37:20,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:20,469 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-16 22:37:20,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:37:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562900795] [2025-03-16 22:37:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562900795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:20,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:37:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754914365] [2025-03-16 22:37:20,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:20,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:37:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:37:20,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:37:20,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:37:20,473 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 22:37:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:20,526 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 22:37:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 7 [2025-03-16 22:37:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:20,527 INFO L225 Difference]: With dead ends: 14 [2025-03-16 22:37:20,527 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 22:37:20,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:20,528 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:20,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:37:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 22:37:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 22:37:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-16 22:37:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:37:20,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:37:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:20,530 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:37:20,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 22:37:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:37:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:37:20,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:20,530 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:37:20,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:37:20,735 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-16 22:37:20,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:20,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:37:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:37:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895693458] [2025-03-16 22:37:20,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:37:20,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:20,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:20,738 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-16 22:37:20,739 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-16 22:37:20,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:37:20,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:37:20,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:37:20,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:20,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:37:20,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:20,991 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-16 22:37:20,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:21,254 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-16 22:37:21,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:37:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895693458] [2025-03-16 22:37:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895693458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:21,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 22:37:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297019084] [2025-03-16 22:37:21,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:21,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 22:37:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:37:21,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 22:37:21,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:37:21,256 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 22:37:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:21,345 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-03-16 22:37:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:37:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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 10 [2025-03-16 22:37:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:21,346 INFO L225 Difference]: With dead ends: 21 [2025-03-16 22:37:21,346 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 22:37:21,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:37:21,347 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:21,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 22:37:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-16 22:37:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 22:37:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-16 22:37:21,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2025-03-16 22:37:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-16 22:37:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-16 22:37:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-03-16 22:37:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 22:37:21,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:21,351 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-03-16 22:37:21,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:37:21,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:21,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-03-16 22:37:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:37:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130175242] [2025-03-16 22:37:21,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 22:37:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:21,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:37:21,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 22:37:21,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-03-16 22:37:21,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 22:37:21,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 22:37:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:21,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 22:37:21,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:37:21,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:37:22,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:37:22,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130175242] [2025-03-16 22:37:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130175242] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:22,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:37:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996867838] [2025-03-16 22:37:22,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:37:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:37:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:37:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:37:22,057 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 22:37:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:22,125 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-16 22:37:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:37:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 13 [2025-03-16 22:37:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:22,126 INFO L225 Difference]: With dead ends: 19 [2025-03-16 22:37:22,126 INFO L226 Difference]: Without dead ends: 17 [2025-03-16 22:37:22,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:37:22,127 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:22,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:37:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-16 22:37:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-16 22:37:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 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-16 22:37:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-16 22:37:22,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2025-03-16 22:37:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:22,132 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-16 22:37:22,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-16 22:37:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-16 22:37:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 22:37:22,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:37:22,133 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-16 22:37:22,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 22:37:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:22,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:37:22,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:37:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1174864737, now seen corresponding path program 4 times [2025-03-16 22:37:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:37:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966031972] [2025-03-16 22:37:22,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 22:37:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:37:22,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:37:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 22:37:22,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-16 22:37:22,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-03-16 22:37:22,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 22:37:22,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:37:22,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-16 22:37:22,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:37:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:37:23,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:37:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:37:23,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:37:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966031972] [2025-03-16 22:37:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966031972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:37:23,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:37:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2025-03-16 22:37:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537764015] [2025-03-16 22:37:23,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:37:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:37:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:37:23,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:37:23,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:37:23,719 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 22:37:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:37:23,890 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-03-16 22:37:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:37:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 16 [2025-03-16 22:37:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:37:23,891 INFO L225 Difference]: With dead ends: 17 [2025-03-16 22:37:23,891 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 22:37:23,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:37:23,892 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:37:23,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:37:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 22:37:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 22:37:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:37:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 22:37:23,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2025-03-16 22:37:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:37:23,893 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 22:37:23,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 22:37:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 22:37:23,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 22:37:23,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:37:23,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 22:37:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:37:24,102 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-03-16 22:37:24,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 22:37:24,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:37:24,277 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-16 22:37:24,278 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-16 22:37:24,279 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-16 22:37:24,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:37:24 BoogieIcfgContainer [2025-03-16 22:37:24,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:37:24,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:37:24,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:37:24,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:37:24,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:37:19" (3/4) ... [2025-03-16 22:37:24,284 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 22:37:24,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 22:37:24,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 22:37:24,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 22:37:24,291 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 22:37:24,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 22:37:24,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 22:37:24,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:37:24,352 INFO L158 Benchmark]: Toolchain (without parser) took 5456.84ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.3MB in the beginning and 66.0MB in the end (delta: 26.2MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2025-03-16 22:37:24,352 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:24,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.84ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:37:24,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.26ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:37:24,353 INFO L158 Benchmark]: Boogie Preprocessor took 33.77ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:24,353 INFO L158 Benchmark]: IcfgBuilder took 246.45ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:37:24,353 INFO L158 Benchmark]: TraceAbstraction took 4928.23ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 62.5MB in the beginning and 70.7MB in the end (delta: -8.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2025-03-16 22:37:24,353 INFO L158 Benchmark]: Witness Printer took 69.47ms. Allocated memory is still 176.2MB. Free memory was 70.7MB in the beginning and 66.0MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:37:24,354 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.21ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.84ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.26ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.2MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.77ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 246.45ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.0MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4928.23ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 62.5MB in the beginning and 70.7MB in the end (delta: -8.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 69.47ms. Allocated memory is still 176.2MB. Free memory was 70.7MB in the beginning and 66.0MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 9 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 17 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=3, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 50 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 87 ConstructedInterpolants, 21 QuantifiedInterpolants, 2998 SizeOfPredicates, 30 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 28/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 56]: Location Invariant Derived location invariant: ((((((((7 == var_17) && (1 == state_27)) && (7 == state_6)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4)) || ((((((7 == var_17) && (1 == state_6)) && (7 == state_30)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4))) || ((((((7 == var_17) && (1 == state_30)) && (1 == mask_SORT_1)) && (1 == var_10)) && (1048575 == mask_SORT_4)) && (7 == state_27))) RESULT: Ultimate proved your program to be correct! [2025-03-16 22:37:24,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE