./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.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 fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:17:45,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:17:45,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:17:45,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:17:45,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:17:45,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:17:45,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:17:45,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:17:45,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:17:45,954 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:17:45,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:17:45,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:17:45,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:17:45,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:17:45,955 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:17:45,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:17:45,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:45,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:17:45,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:17:45,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:17:45,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:17:45,957 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 -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2025-03-03 17:17:46,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:17:46,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:17:46,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:17:46,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:17:46,203 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:17:46,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:17:47,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0698670a5/0c3a0b90b3c042969f85590b72f6b5c5/FLAG83a09c12e [2025-03-03 17:17:47,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:17:47,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:17:47,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0698670a5/0c3a0b90b3c042969f85590b72f6b5c5/FLAG83a09c12e [2025-03-03 17:17:47,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0698670a5/0c3a0b90b3c042969f85590b72f6b5c5 [2025-03-03 17:17:47,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:17:47,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:17:47,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:47,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:17:47,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:17:47,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdc3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47, skipping insertion in model container [2025-03-03 17:17:47,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:17:47,666 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.cav14_example_v.c[1255,1268] [2025-03-03 17:17:47,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:47,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:17:47,718 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.cav14_example_v.c[1255,1268] [2025-03-03 17:17:47,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:47,751 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:17:47,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47 WrapperNode [2025-03-03 17:17:47,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:47,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:47,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:17:47,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:17:47,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,791 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 187 [2025-03-03 17:17:47,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:47,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:17:47,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:17:47,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:17:47,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:17:47,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:17:47,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:17:47,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:17:47,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:17:47,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:47,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:47,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:17:47,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:17:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:17:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:17:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:17:47,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:17:47,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:17:47,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:17:48,271 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-03 17:17:48,271 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:17:48,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:17:48,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:17:48,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:48 BoogieIcfgContainer [2025-03-03 17:17:48,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:17:48,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:17:48,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:17:48,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:17:48,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:17:47" (1/3) ... [2025-03-03 17:17:48,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8efd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:48, skipping insertion in model container [2025-03-03 17:17:48,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (2/3) ... [2025-03-03 17:17:48,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8efd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:48, skipping insertion in model container [2025-03-03 17:17:48,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:48" (3/3) ... [2025-03-03 17:17:48,300 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:17:48,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:17:48,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example_v.c that has 1 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:17:48,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:17:48,361 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;@cc58cc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:17:48,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:17:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 17:17:48,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 773109631, now seen corresponding path program 1 times [2025-03-03 17:17:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487254324] [2025-03-03 17:17:48,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 17:17:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 17:17:48,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:48,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487254324] [2025-03-03 17:17:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487254324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:17:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327552325] [2025-03-03 17:17:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:17:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:48,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:17:48,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,757 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 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 3.25) internal successors, (13), 4 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-03 17:17:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:48,815 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2025-03-03 17:17:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:17:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 13 [2025-03-03 17:17:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:48,821 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:17:48,821 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 17:17:48,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,826 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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-03 17:17:48,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 17:17:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 17:17:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 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-03 17:17:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 17:17:48,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2025-03-03 17:17:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 17:17:48,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-03 17:17:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 17:17:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:17:48,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:17:48,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1798726028, now seen corresponding path program 1 times [2025-03-03 17:17:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516510780] [2025-03-03 17:17:48,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 17:17:48,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:17:48,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:48,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516510780] [2025-03-03 17:17:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516510780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:17:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238588345] [2025-03-03 17:17:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:17:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:48,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:17:48,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,939 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:48,975 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2025-03-03 17:17:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:17:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 17:17:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:48,976 INFO L225 Difference]: With dead ends: 90 [2025-03-03 17:17:48,977 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 17:17:48,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,978 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 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-03 17:17:48,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 17:17:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 17:17:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2025-03-03 17:17:48,981 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2025-03-03 17:17:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-03 17:17:48,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2025-03-03 17:17:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 17:17:48,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:17:48,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2005577242, now seen corresponding path program 1 times [2025-03-03 17:17:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655219561] [2025-03-03 17:17:48,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 17:17:49,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 17:17:49,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:49,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655219561] [2025-03-03 17:17:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655219561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:49,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:49,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:17:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202547906] [2025-03-03 17:17:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:17:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:49,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:17:49,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:17:49,184 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:49,265 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2025-03-03 17:17:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:17:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-03-03 17:17:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:49,267 INFO L225 Difference]: With dead ends: 119 [2025-03-03 17:17:49,267 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 17:17:49,267 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-03 17:17:49,267 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:49,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 184 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 17:17:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2025-03-03 17:17:49,270 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-03 17:17:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-03 17:17:49,272 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2025-03-03 17:17:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:49,272 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-03 17:17:49,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-03 17:17:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 17:17:49,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:49,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:17:49,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash -737239294, now seen corresponding path program 1 times [2025-03-03 17:17:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747523943] [2025-03-03 17:17:49,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:49,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:17:49,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:17:49,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747523943] [2025-03-03 17:17:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747523943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:49,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:49,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029535500] [2025-03-03 17:17:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:49,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:49,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:49,749 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:49,890 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2025-03-03 17:17:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2025-03-03 17:17:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:49,891 INFO L225 Difference]: With dead ends: 144 [2025-03-03 17:17:49,891 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 17:17:49,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:17:49,892 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 60 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:49,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 439 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 17:17:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2025-03-03 17:17:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2025-03-03 17:17:49,899 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 34 [2025-03-03 17:17:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:49,899 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2025-03-03 17:17:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2025-03-03 17:17:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:17:49,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:49,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:49,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:17:49,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1745530216, now seen corresponding path program 1 times [2025-03-03 17:17:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747628405] [2025-03-03 17:17:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:49,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:17:49,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:17:49,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:49,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:50,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747628405] [2025-03-03 17:17:50,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747628405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:17:50,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30173878] [2025-03-03 17:17:50,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:50,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:50,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:17:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:17:50,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:17:50,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:17:50,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:50,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:50,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 17:17:50,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:17:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:50,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:17:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30173878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:50,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:17:50,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-03 17:17:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439120565] [2025-03-03 17:17:50,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:50,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:50,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:50,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:17:50,621 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:50,843 INFO L93 Difference]: Finished difference Result 157 states and 219 transitions. [2025-03-03 17:17:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:17:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 17:17:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:50,848 INFO L225 Difference]: With dead ends: 157 [2025-03-03 17:17:50,848 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 17:17:50,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:17:50,849 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 136 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:50,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 90 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:17:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 17:17:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2025-03-03 17:17:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2025-03-03 17:17:50,855 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2025-03-03 17:17:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2025-03-03 17:17:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2025-03-03 17:17:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:17:50,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:50,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:50,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:17:51,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:51,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1581135146, now seen corresponding path program 1 times [2025-03-03 17:17:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261038743] [2025-03-03 17:17:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:17:51,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:17:51,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:51,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261038743] [2025-03-03 17:17:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261038743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:17:51,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440803529] [2025-03-03 17:17:51,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:51,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:17:51,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:51,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:17:51,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:17:51,346 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:51,538 INFO L93 Difference]: Finished difference Result 179 states and 248 transitions. [2025-03-03 17:17:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 17:17:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:51,539 INFO L225 Difference]: With dead ends: 179 [2025-03-03 17:17:51,539 INFO L226 Difference]: Without dead ends: 125 [2025-03-03 17:17:51,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:17:51,540 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 153 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:51,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 225 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-03 17:17:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2025-03-03 17:17:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2025-03-03 17:17:51,548 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 36 [2025-03-03 17:17:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2025-03-03 17:17:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2025-03-03 17:17:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:51,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:51,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:17:51,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1131215943, now seen corresponding path program 1 times [2025-03-03 17:17:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74566878] [2025-03-03 17:17:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:51,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:51,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:51,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74566878] [2025-03-03 17:17:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74566878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:17:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717690772] [2025-03-03 17:17:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:17:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:52,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:17:52,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:17:52,090 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:52,192 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2025-03-03 17:17:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:17:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:17:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:52,193 INFO L225 Difference]: With dead ends: 175 [2025-03-03 17:17:52,193 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 17:17:52,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:17:52,194 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:52,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 168 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 17:17:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-03 17:17:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2025-03-03 17:17:52,205 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 37 [2025-03-03 17:17:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:52,205 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2025-03-03 17:17:52,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2025-03-03 17:17:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:52,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:52,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:52,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:17:52,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:52,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1086149374, now seen corresponding path program 1 times [2025-03-03 17:17:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984135268] [2025-03-03 17:17:52,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:52,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:52,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:52,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:52,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984135268] [2025-03-03 17:17:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984135268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:17:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477930872] [2025-03-03 17:17:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:17:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:52,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:17:52,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:17:52,672 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:52,816 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2025-03-03 17:17:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:17:52,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:17:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:52,817 INFO L225 Difference]: With dead ends: 191 [2025-03-03 17:17:52,817 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 17:17:52,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:17:52,818 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:52,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 169 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 17:17:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-03 17:17:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.371900826446281) internal successors, (166), 121 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2025-03-03 17:17:52,825 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 37 [2025-03-03 17:17:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:52,826 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2025-03-03 17:17:52,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2025-03-03 17:17:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:52,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:52,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:52,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:17:52,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:52,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 829205670, now seen corresponding path program 1 times [2025-03-03 17:17:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:52,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134729597] [2025-03-03 17:17:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:52,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:52,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:53,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134729597] [2025-03-03 17:17:53,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134729597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:53,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:53,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:17:53,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649035369] [2025-03-03 17:17:53,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:53,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:17:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:53,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:17:53,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:17:53,067 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:53,124 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2025-03-03 17:17:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:17:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:17:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:53,125 INFO L225 Difference]: With dead ends: 191 [2025-03-03 17:17:53,125 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 17:17:53,126 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-03 17:17:53,126 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:53,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 17:17:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 17:17:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2025-03-03 17:17:53,133 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 37 [2025-03-03 17:17:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2025-03-03 17:17:53,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2025-03-03 17:17:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:17:53,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:53,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:17:53,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash 837867173, now seen corresponding path program 1 times [2025-03-03 17:17:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755103666] [2025-03-03 17:17:53,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:17:53,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:17:53,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755103666] [2025-03-03 17:17:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755103666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:53,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455201478] [2025-03-03 17:17:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:53,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:53,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:53,484 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:53,612 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2025-03-03 17:17:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:53,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 17:17:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:53,613 INFO L225 Difference]: With dead ends: 183 [2025-03-03 17:17:53,613 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 17:17:53,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:17:53,614 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 56 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:53,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 386 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 17:17:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 92. [2025-03-03 17:17:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2025-03-03 17:17:53,621 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 38 [2025-03-03 17:17:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2025-03-03 17:17:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2025-03-03 17:17:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 17:17:53,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:53,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:53,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:17:53,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:53,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1266921648, now seen corresponding path program 1 times [2025-03-03 17:17:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:53,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784365122] [2025-03-03 17:17:53,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:17:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:17:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784365122] [2025-03-03 17:17:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784365122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:17:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316901257] [2025-03-03 17:17:54,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:54,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:54,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:54,062 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-03 17:17:54,064 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-03 17:17:54,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 17:17:54,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 17:17:54,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:54,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 17:17:54,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:17:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:54,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:17:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:55,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316901257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:17:55,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:17:55,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 35 [2025-03-03 17:17:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70046256] [2025-03-03 17:17:55,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:17:55,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 17:17:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:55,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 17:17:55,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 17:17:55,110 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 35 states, 35 states have (on average 3.7714285714285714) internal successors, (132), 35 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:55,727 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2025-03-03 17:17:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 17:17:55,727 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7714285714285714) internal successors, (132), 35 states have internal predecessors, (132), 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 56 [2025-03-03 17:17:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:55,728 INFO L225 Difference]: With dead ends: 205 [2025-03-03 17:17:55,728 INFO L226 Difference]: Without dead ends: 149 [2025-03-03 17:17:55,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=2419, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 17:17:55,729 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 563 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:55,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 449 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:17:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-03 17:17:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2025-03-03 17:17:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2025-03-03 17:17:55,733 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 56 [2025-03-03 17:17:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:55,733 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2025-03-03 17:17:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7714285714285714) internal successors, (132), 35 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2025-03-03 17:17:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 17:17:55,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:55,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:55,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:17:55,934 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,SelfDestructingSolverStorable10 [2025-03-03 17:17:55,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1827038155, now seen corresponding path program 1 times [2025-03-03 17:17:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385466810] [2025-03-03 17:17:55,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:17:56,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:17:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385466810] [2025-03-03 17:17:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385466810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:17:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904055467] [2025-03-03 17:17:56,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:56,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:56,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:56,722 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-03 17:17:56,724 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-03 17:17:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:17:56,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:17:56,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:56,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:56,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-03-03 17:17:56,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:17:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:57,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:17:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904055467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:17:59,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:17:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 23] total 45 [2025-03-03 17:17:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63694377] [2025-03-03 17:17:59,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:17:59,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 17:17:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:59,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 17:17:59,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 17:17:59,055 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 45 states, 45 states have (on average 3.422222222222222) internal successors, (154), 45 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:01,740 INFO L93 Difference]: Finished difference Result 430 states and 579 transitions. [2025-03-03 17:18:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-03 17:18:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.422222222222222) internal successors, (154), 45 states have internal predecessors, (154), 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 58 [2025-03-03 17:18:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:01,742 INFO L225 Difference]: With dead ends: 430 [2025-03-03 17:18:01,742 INFO L226 Difference]: Without dead ends: 331 [2025-03-03 17:18:01,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1318, Invalid=10454, Unknown=0, NotChecked=0, Total=11772 [2025-03-03 17:18:01,746 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 490 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:01,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 533 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:18:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-03 17:18:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 249. [2025-03-03 17:18:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 248 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 329 transitions. [2025-03-03 17:18:01,757 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 329 transitions. Word has length 58 [2025-03-03 17:18:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:01,757 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 329 transitions. [2025-03-03 17:18:01,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.422222222222222) internal successors, (154), 45 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 329 transitions. [2025-03-03 17:18:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 17:18:01,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:01,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:01,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 17:18:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:01,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:01,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2026936676, now seen corresponding path program 1 times [2025-03-03 17:18:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:18:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926995635] [2025-03-03 17:18:01,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:18:01,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:18:02,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:18:02,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:02,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:18:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926995635] [2025-03-03 17:18:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926995635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:18:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176514060] [2025-03-03 17:18:02,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:02,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:02,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:02,724 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-03 17:18:02,726 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-03 17:18:02,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 17:18:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 17:18:02,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:02,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:02,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-03 17:18:02,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:03,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176514060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:07,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:18:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 24] total 53 [2025-03-03 17:18:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077137443] [2025-03-03 17:18:07,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:07,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 17:18:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:18:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 17:18:07,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2432, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 17:18:07,515 INFO L87 Difference]: Start difference. First operand 249 states and 329 transitions. Second operand has 53 states, 53 states have (on average 2.9622641509433962) internal successors, (157), 53 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:29,385 INFO L93 Difference]: Finished difference Result 904 states and 1225 transitions. [2025-03-03 17:18:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-03 17:18:29,385 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.9622641509433962) internal successors, (157), 53 states have internal predecessors, (157), 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 58 [2025-03-03 17:18:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:29,387 INFO L225 Difference]: With dead ends: 904 [2025-03-03 17:18:29,387 INFO L226 Difference]: Without dead ends: 682 [2025-03-03 17:18:29,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4147 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1544, Invalid=12498, Unknown=0, NotChecked=0, Total=14042 [2025-03-03 17:18:29,391 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 826 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:29,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 915 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 17:18:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-03 17:18:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 640. [2025-03-03 17:18:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.3380281690140845) internal successors, (855), 639 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 855 transitions. [2025-03-03 17:18:29,408 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 855 transitions. Word has length 58 [2025-03-03 17:18:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 855 transitions. [2025-03-03 17:18:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.9622641509433962) internal successors, (157), 53 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 855 transitions. [2025-03-03 17:18:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 17:18:29,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:29,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:29,417 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-03 17:18:29,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:29,610 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1149814955, now seen corresponding path program 1 times [2025-03-03 17:18:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:18:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196016324] [2025-03-03 17:18:29,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:18:29,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 17:18:29,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 17:18:29,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:29,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:18:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196016324] [2025-03-03 17:18:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196016324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:18:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868539005] [2025-03-03 17:18:30,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:30,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:30,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:30,378 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-03 17:18:30,379 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-03 17:18:30,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 17:18:30,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 17:18:30,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:30,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:30,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 201 conjuncts are in the unsatisfiable core [2025-03-03 17:18:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:31,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868539005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:35,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:18:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26, 34] total 68 [2025-03-03 17:18:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922219594] [2025-03-03 17:18:35,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-03 17:18:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:18:35,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-03 17:18:35,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=3841, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 17:18:35,308 INFO L87 Difference]: Start difference. First operand 640 states and 855 transitions. Second operand has 68 states, 68 states have (on average 2.5) internal successors, (170), 68 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:38,362 INFO L93 Difference]: Finished difference Result 1470 states and 1987 transitions. [2025-03-03 17:18:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-03 17:18:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.5) internal successors, (170), 68 states have internal predecessors, (170), 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 61 [2025-03-03 17:18:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:38,366 INFO L225 Difference]: With dead ends: 1470 [2025-03-03 17:18:38,366 INFO L226 Difference]: Without dead ends: 1038 [2025-03-03 17:18:38,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4408 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2249, Invalid=12271, Unknown=0, NotChecked=0, Total=14520 [2025-03-03 17:18:38,370 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1098 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:38,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 829 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2835 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 17:18:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-03 17:18:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 871. [2025-03-03 17:18:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.3367816091954023) internal successors, (1163), 870 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1163 transitions. [2025-03-03 17:18:38,392 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1163 transitions. Word has length 61 [2025-03-03 17:18:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:38,392 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1163 transitions. [2025-03-03 17:18:38,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.5) internal successors, (170), 68 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1163 transitions. [2025-03-03 17:18:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 17:18:38,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:38,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:38,401 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-03 17:18:38,593 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,SelfDestructingSolverStorable13 [2025-03-03 17:18:38,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 80277758, now seen corresponding path program 1 times [2025-03-03 17:18:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:18:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342372472] [2025-03-03 17:18:38,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:18:38,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 17:18:38,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 17:18:38,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:38,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:39,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:18:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342372472] [2025-03-03 17:18:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342372472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:18:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680035709] [2025-03-03 17:18:39,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:39,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:39,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:39,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:18:39,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 17:18:39,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 17:18:39,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 17:18:39,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:39,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:39,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-03 17:18:39,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:40,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 17:18:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680035709] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 17:18:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:18:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 12] total 31 [2025-03-03 17:18:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130313864] [2025-03-03 17:18:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:18:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:18:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:18:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:18:40,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-03-03 17:18:40,211 INFO L87 Difference]: Start difference. First operand 871 states and 1163 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:40,392 INFO L93 Difference]: Finished difference Result 2293 states and 3096 transitions. [2025-03-03 17:18:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:18:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 17:18:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:40,398 INFO L225 Difference]: With dead ends: 2293 [2025-03-03 17:18:40,398 INFO L226 Difference]: Without dead ends: 1611 [2025-03-03 17:18:40,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 17:18:40,402 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 97 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:40,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 328 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:18:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-03-03 17:18:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 800. [2025-03-03 17:18:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.3354192740926158) internal successors, (1067), 799 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1067 transitions. [2025-03-03 17:18:40,430 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1067 transitions. Word has length 62 [2025-03-03 17:18:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:40,431 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1067 transitions. [2025-03-03 17:18:40,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1067 transitions. [2025-03-03 17:18:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 17:18:40,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:40,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:40,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 17:18:40,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 17:18:40,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:40,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash -132145258, now seen corresponding path program 1 times [2025-03-03 17:18:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:18:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644492752] [2025-03-03 17:18:40,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:18:40,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 17:18:40,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 17:18:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:18:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:18:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644492752] [2025-03-03 17:18:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644492752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:18:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:18:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:18:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045348587] [2025-03-03 17:18:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:18:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:18:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:18:40,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:18:40,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:18:40,914 INFO L87 Difference]: Start difference. First operand 800 states and 1067 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:41,071 INFO L93 Difference]: Finished difference Result 1634 states and 2208 transitions. [2025-03-03 17:18:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:18:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 62 [2025-03-03 17:18:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:41,074 INFO L225 Difference]: With dead ends: 1634 [2025-03-03 17:18:41,074 INFO L226 Difference]: Without dead ends: 1008 [2025-03-03 17:18:41,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:18:41,075 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:41,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 492 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:18:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-03 17:18:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 875. [2025-03-03 17:18:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.339816933638444) internal successors, (1171), 874 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1171 transitions. [2025-03-03 17:18:41,101 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1171 transitions. Word has length 62 [2025-03-03 17:18:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:41,101 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1171 transitions. [2025-03-03 17:18:41,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1171 transitions. [2025-03-03 17:18:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 17:18:41,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:41,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:41,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:18:41,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:41,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash 805619263, now seen corresponding path program 1 times [2025-03-03 17:18:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:18:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297123234] [2025-03-03 17:18:41,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:18:41,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:18:41,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:18:41,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:41,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:18:41,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:18:41,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 17:18:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 17:18:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:18:41,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:18:41,306 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:18:41,307 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:18:41,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:18:41,313 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:41,339 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:18:41,340 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:18:41,340 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:18:41,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:18:41,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:18:41 BoogieIcfgContainer [2025-03-03 17:18:41,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:18:41,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:18:41,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:18:41,354 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:18:41,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:48" (3/4) ... [2025-03-03 17:18:41,356 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:18:41,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:18:41,357 INFO L158 Benchmark]: Toolchain (without parser) took 53813.57ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 112.9MB in the beginning and 283.1MB in the end (delta: -170.2MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. [2025-03-03 17:18:41,357 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:18:41,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:18:41,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:18:41,358 INFO L158 Benchmark]: Boogie Preprocessor took 46.35ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:18:41,358 INFO L158 Benchmark]: IcfgBuilder took 454.14ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 61.9MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:18:41,358 INFO L158 Benchmark]: TraceAbstraction took 53058.87ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 61.4MB in the beginning and 283.3MB in the end (delta: -221.8MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. [2025-03-03 17:18:41,358 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 578.8MB. Free memory was 283.3MB in the beginning and 283.1MB in the end (delta: 120.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:18:41,359 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.44ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.44ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.6MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.41ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.35ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 92.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 454.14ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 61.9MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 53058.87ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 61.4MB in the beginning and 283.3MB in the end (delta: -221.8MB). Peak memory consumption was 214.5MB. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 578.8MB. Free memory was 283.3MB in the beginning and 283.1MB in the end (delta: 120.2kB). 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 115, overapproximation of bitwiseAnd at line 89. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=1, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_26=1, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_34=1, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.0s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3669 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3669 mSDsluCounter, 5709 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4914 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10325 IncrementalHoareTripleChecker+Invalid, 10450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 795 mSDtfsCounter, 10325 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 996 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12288 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=16, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1408 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 18951 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2384 ConjunctsInSsa, 639 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 332/561 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:18:41,378 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.cav14_example_v.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 fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:18:43,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:18:43,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:18:43,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:18:43,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:18:43,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:18:43,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:18:43,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:18:43,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:18:43,296 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:18:43,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:18:43,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:18:43,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:18:43,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:18:43,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:18:43,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:18:43,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:18:43,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:18:43,298 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 -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2025-03-03 17:18:43,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:18:43,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:18:43,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:18:43,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:18:43,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:18:43,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:18:44,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ee2c481/00580960fe8c46dcac12980000f9191f/FLAG993636b82 [2025-03-03 17:18:44,872 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:18:44,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:18:44,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ee2c481/00580960fe8c46dcac12980000f9191f/FLAG993636b82 [2025-03-03 17:18:45,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ee2c481/00580960fe8c46dcac12980000f9191f [2025-03-03 17:18:45,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:18:45,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:18:45,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:18:45,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:18:45,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:18:45,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6d4644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45, skipping insertion in model container [2025-03-03 17:18:45,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:18:45,352 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.cav14_example_v.c[1255,1268] [2025-03-03 17:18:45,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:18:45,386 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:18:45,392 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.cav14_example_v.c[1255,1268] [2025-03-03 17:18:45,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:18:45,415 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:18:45,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45 WrapperNode [2025-03-03 17:18:45,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:18:45,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:18:45,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:18:45,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:18:45,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,445 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-03-03 17:18:45,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:18:45,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:18:45,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:18:45,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:18:45,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:18:45,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:18:45,490 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:18:45,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:18:45,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:18:45,491 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (1/1) ... [2025-03-03 17:18:45,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:18:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:45,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:18:45,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:18:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:18:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:18:45,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:18:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:18:45,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:18:45,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:18:45,723 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 17:18:45,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:18:45,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:18:45,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:18:45,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:18:45 BoogieIcfgContainer [2025-03-03 17:18:45,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:18:45,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:18:45,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:18:45,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:18:45,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:18:45" (1/3) ... [2025-03-03 17:18:45,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2a4b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:18:45, skipping insertion in model container [2025-03-03 17:18:45,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:18:45" (2/3) ... [2025-03-03 17:18:45,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2a4b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:18:45, skipping insertion in model container [2025-03-03 17:18:45,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:18:45" (3/3) ... [2025-03-03 17:18:45,736 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2025-03-03 17:18:45,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:18:45,746 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example_v.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:18:45,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:18:45,785 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;@58cfcdb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:18:45,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:18:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:18:45,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:45,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:18:45,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:18:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161941686] [2025-03-03 17:18:45,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:45,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:45,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:18:45,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:18:45,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:18:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:18:45,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:45,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:18:45,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:46,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:18:46,102 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:18:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161941686] [2025-03-03 17:18:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161941686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:18:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:18:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:18:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698059264] [2025-03-03 17:18:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:18:46,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:18:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:18:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:18:46,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:18:46,125 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:46,157 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:18:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:18:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:18:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:46,166 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:18:46,166 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:18:46,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:18:46,172 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:46,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:18:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:18:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:18:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:18:46,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:18:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:46,196 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:18:46,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:18:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:18:46,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:46,198 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:18:46,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:18:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:46,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:46,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:18:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118304715] [2025-03-03 17:18:46,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:18:46,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:46,403 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-03 17:18:46,404 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-03 17:18:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:18:46,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:18:46,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:18:46,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:46,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 17:18:46,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:46,712 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-03 17:18:46,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:47,798 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-03 17:18:47,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:18:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118304715] [2025-03-03 17:18:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118304715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:47,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:18:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:18:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719722572] [2025-03-03 17:18:47,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:47,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:18:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:18:47,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:18:47,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:18:47,801 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:47,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:47,939 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-03 17:18:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:18:47,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:18:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:47,940 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:18:47,940 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 17:18:47,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:18:47,941 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:47,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:18:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 17:18:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 17:18:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 17:18:47,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-03 17:18:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:47,944 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 17:18:47,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 17:18:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:18:47,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:47,944 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 17:18:47,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:18:48,149 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-03 17:18:48,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-03 17:18:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104662461] [2025-03-03 17:18:48,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:18:48,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:48,155 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-03 17:18:48,157 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-03 17:18:48,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 17:18:48,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:18:48,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:18:48,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:48,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 17:18:48,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:48,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:53,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:18:53,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104662461] [2025-03-03 17:18:53,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104662461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:53,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:18:53,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2025-03-03 17:18:53,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249756275] [2025-03-03 17:18:53,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:53,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 17:18:53,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:18:53,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 17:18:53,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:18:53,630 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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-03 17:18:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:54,800 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-03 17:18:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 17:18:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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 14 [2025-03-03 17:18:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:54,801 INFO L225 Difference]: With dead ends: 30 [2025-03-03 17:18:54,801 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 17:18:54,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2025-03-03 17:18:54,802 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:54,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 30 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:18:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 17:18:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-03 17:18:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-03 17:18:54,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2025-03-03 17:18:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:54,806 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-03 17:18:54,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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-03 17:18:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-03 17:18:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 17:18:54,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:54,807 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2025-03-03 17:18:54,812 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-03 17:18:55,007 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-03 17:18:55,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1480598813, now seen corresponding path program 3 times [2025-03-03 17:18:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037904239] [2025-03-03 17:18:55,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 17:18:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:55,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:55,010 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-03 17:18:55,011 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-03 17:18:55,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 8 equivalence classes. [2025-03-03 17:18:55,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 17:18:55,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-03 17:18:55,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:55,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-03 17:18:55,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:56,624 INFO L312 TraceCheckSpWp]: Computing backward predicates...