./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.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 da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:36:00,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:36:00,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:36:00,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:36:00,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:36:00,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:36:00,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:36:00,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:36:00,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:36:00,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:36:00,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:36:00,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:36:00,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:36:00,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:36:00,969 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:36:00,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:36:00,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:00,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:36:00,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:36:00,971 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 -> da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c [2025-03-16 21:36:01,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:36:01,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:36:01,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:36:01,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:36:01,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:36:01,218 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.c [2025-03-16 21:36:02,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048f59c5f/fbb13c45b8554c22a9226ef468b24969/FLAGcfa255e0f [2025-03-16 21:36:02,600 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:36:02,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2025-03-16 21:36:02,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048f59c5f/fbb13c45b8554c22a9226ef468b24969/FLAGcfa255e0f [2025-03-16 21:36:02,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048f59c5f/fbb13c45b8554c22a9226ef468b24969 [2025-03-16 21:36:02,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:36:02,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:36:02,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:02,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:36:02,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:36:02,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48531b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02, skipping insertion in model container [2025-03-16 21:36:02,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:36:02,732 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.c[1253,1266] [2025-03-16 21:36:02,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:02,785 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:36:02,794 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.c[1253,1266] [2025-03-16 21:36:02,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:02,839 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:36:02,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02 WrapperNode [2025-03-16 21:36:02,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:02,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:02,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:36:02,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:36:02,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,892 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 187 [2025-03-16 21:36:02,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:02,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:36:02,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:36:02,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:36:02,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,925 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:36:02,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:36:02,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:36:02,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:36:02,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:36:02,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (1/1) ... [2025-03-16 21:36:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:02,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:02,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:36:02,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:36:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:36:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:36:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:36:02,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:36:03,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:36:03,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:36:03,406 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-16 21:36:03,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:36:03,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:36:03,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:36:03,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:03 BoogieIcfgContainer [2025-03-16 21:36:03,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:36:03,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:36:03,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:36:03,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:36:03,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:36:02" (1/3) ... [2025-03-16 21:36:03,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a98ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:03, skipping insertion in model container [2025-03-16 21:36:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:02" (2/3) ... [2025-03-16 21:36:03,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a98ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:03, skipping insertion in model container [2025-03-16 21:36:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:03" (3/3) ... [2025-03-16 21:36:03,439 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2025-03-16 21:36:03,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:36:03,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example.c that has 1 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:36:03,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:36:03,505 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;@46bc57a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:36:03,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:36:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 21:36:03,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:03,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:03,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 711580305, now seen corresponding path program 1 times [2025-03-16 21:36:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:03,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716135794] [2025-03-16 21:36:03,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:03,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 21:36:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 21:36:03,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:03,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:03,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716135794] [2025-03-16 21:36:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716135794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935427893] [2025-03-16 21:36:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:03,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:03,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:03,887 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:03,943 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2025-03-16 21:36:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 21:36:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:03,949 INFO L225 Difference]: With dead ends: 87 [2025-03-16 21:36:03,950 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 21:36:03,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:03,953 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:03,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 21:36:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 21:36:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-16 21:36:03,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 12 [2025-03-16 21:36:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:03,977 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-16 21:36:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-16 21:36:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 21:36:03,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:03,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:03,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:36:03,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 588832160, now seen corresponding path program 1 times [2025-03-16 21:36:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143223124] [2025-03-16 21:36:03,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:03,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 21:36:04,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 21:36:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143223124] [2025-03-16 21:36:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143223124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111134244] [2025-03-16 21:36:04,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:04,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:04,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:04,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:04,087 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. 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-16 21:36:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:04,150 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2025-03-16 21:36:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:04,150 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-16 21:36:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:04,151 INFO L225 Difference]: With dead ends: 89 [2025-03-16 21:36:04,151 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 21:36:04,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:04,152 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:04,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 21:36:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 21:36:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-03-16 21:36:04,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 13 [2025-03-16 21:36:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-03-16 21:36:04,155 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-16 21:36:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-03-16 21:36:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 21:36:04,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:04,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:04,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:36:04,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:04,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1289530260, now seen corresponding path program 1 times [2025-03-16 21:36:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:04,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74158350] [2025-03-16 21:36:04,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:04,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 21:36:04,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 21:36:04,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:04,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74158350] [2025-03-16 21:36:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74158350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254605371] [2025-03-16 21:36:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:04,432 INFO L87 Difference]: Start difference. First operand 50 states and 70 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-16 21:36:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:04,525 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2025-03-16 21:36:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:04,526 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-16 21:36:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:04,527 INFO L225 Difference]: With dead ends: 118 [2025-03-16 21:36:04,527 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 21:36:04,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:04,528 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:04,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 143 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 21:36:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2025-03-16 21:36:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2025-03-16 21:36:04,535 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 14 [2025-03-16 21:36:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:04,536 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2025-03-16 21:36:04,536 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-16 21:36:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2025-03-16 21:36:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 21:36:04,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:04,537 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] [2025-03-16 21:36:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:36:04,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1081582162, now seen corresponding path program 1 times [2025-03-16 21:36:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225856115] [2025-03-16 21:36:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:04,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 21:36:04,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 21:36:04,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:04,933 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-16 21:36:04,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:04,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225856115] [2025-03-16 21:36:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225856115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:04,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975199846] [2025-03-16 21:36:04,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:04,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:04,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:04,936 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:05,110 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2025-03-16 21:36:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:05,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 33 [2025-03-16 21:36:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:05,111 INFO L225 Difference]: With dead ends: 143 [2025-03-16 21:36:05,113 INFO L226 Difference]: Without dead ends: 102 [2025-03-16 21:36:05,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-16 21:36:05,114 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 433 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-16 21:36:05,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 433 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-16 21:36:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 63. [2025-03-16 21:36:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2025-03-16 21:36:05,119 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 33 [2025-03-16 21:36:05,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:05,119 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2025-03-16 21:36:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2025-03-16 21:36:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 21:36:05,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:05,121 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-16 21:36:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:36:05,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:05,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash -339164102, now seen corresponding path program 1 times [2025-03-16 21:36:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890994667] [2025-03-16 21:36:05,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 21:36:05,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 21:36:05,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:05,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:05,526 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-16 21:36:05,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890994667] [2025-03-16 21:36:05,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890994667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786653553] [2025-03-16 21:36:05,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:05,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:05,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:05,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:36:05,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 21:36:05,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 21:36:05,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:05,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:05,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 21:36:05,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:05,858 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-16 21:36:05,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:36:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786653553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:36:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-03-16 21:36:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550776299] [2025-03-16 21:36:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:05,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:05,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:05,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:36:05,860 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 8 states, 8 states have (on average 4.25) 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-16 21:36:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:06,026 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2025-03-16 21:36:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:36:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) 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-16 21:36:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:06,028 INFO L225 Difference]: With dead ends: 156 [2025-03-16 21:36:06,028 INFO L226 Difference]: Without dead ends: 102 [2025-03-16 21:36:06,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:36:06,029 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:06,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 192 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-16 21:36:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2025-03-16 21:36:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2025-03-16 21:36:06,038 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 34 [2025-03-16 21:36:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:06,039 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2025-03-16 21:36:06,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) 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-16 21:36:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2025-03-16 21:36:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 21:36:06,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:06,039 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-16 21:36:06,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:36:06,240 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-16 21:36:06,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:06,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1782149566, now seen corresponding path program 1 times [2025-03-16 21:36:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:06,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083612830] [2025-03-16 21:36:06,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:06,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 21:36:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 21:36:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:06,566 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-16 21:36:06,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:06,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083612830] [2025-03-16 21:36:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083612830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:06,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945126921] [2025-03-16 21:36:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:06,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:06,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:06,567 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.375) 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-16 21:36:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:06,731 INFO L93 Difference]: Finished difference Result 182 states and 253 transitions. [2025-03-16 21:36:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) 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-16 21:36:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:06,732 INFO L225 Difference]: With dead ends: 182 [2025-03-16 21:36:06,732 INFO L226 Difference]: Without dead ends: 128 [2025-03-16 21:36:06,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:36:06,733 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:06,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 251 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-16 21:36:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2025-03-16 21:36:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 93 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2025-03-16 21:36:06,743 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 35 [2025-03-16 21:36:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:06,743 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2025-03-16 21:36:06,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) 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-16 21:36:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2025-03-16 21:36:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 21:36:06,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:06,744 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-16 21:36:06,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:36:06,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:06,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1227271627, now seen corresponding path program 1 times [2025-03-16 21:36:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234936932] [2025-03-16 21:36:06,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:06,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:06,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:06,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:06,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:07,307 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-16 21:36:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234936932] [2025-03-16 21:36:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234936932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646134142] [2025-03-16 21:36:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:07,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:07,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:07,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:07,308 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:07,523 INFO L93 Difference]: Finished difference Result 190 states and 260 transitions. [2025-03-16 21:36:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:07,524 INFO L225 Difference]: With dead ends: 190 [2025-03-16 21:36:07,524 INFO L226 Difference]: Without dead ends: 136 [2025-03-16 21:36:07,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:36:07,525 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:07,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-16 21:36:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 107. [2025-03-16 21:36:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2025-03-16 21:36:07,533 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 36 [2025-03-16 21:36:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2025-03-16 21:36:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2025-03-16 21:36:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 21:36:07,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:07,536 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-16 21:36:07,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:36:07,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:07,537 INFO L85 PathProgramCache]: Analyzing trace with hash -850330352, now seen corresponding path program 1 times [2025-03-16 21:36:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932974325] [2025-03-16 21:36:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:07,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:07,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:08,051 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-16 21:36:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932974325] [2025-03-16 21:36:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932974325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888623843] [2025-03-16 21:36:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:08,054 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:08,247 INFO L93 Difference]: Finished difference Result 199 states and 274 transitions. [2025-03-16 21:36:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:08,248 INFO L225 Difference]: With dead ends: 199 [2025-03-16 21:36:08,248 INFO L226 Difference]: Without dead ends: 133 [2025-03-16 21:36:08,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-16 21:36:08,249 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:08,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 164 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-16 21:36:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2025-03-16 21:36:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2025-03-16 21:36:08,253 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 36 [2025-03-16 21:36:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2025-03-16 21:36:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 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-16 21:36:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2025-03-16 21:36:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 21:36:08,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,254 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-16 21:36:08,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:36:08,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1870931240, now seen corresponding path program 1 times [2025-03-16 21:36:08,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017104004] [2025-03-16 21:36:08,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:08,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:08,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:08,616 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-16 21:36:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017104004] [2025-03-16 21:36:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017104004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:36:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740999506] [2025-03-16 21:36:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:08,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:08,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:08,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:08,619 INFO L87 Difference]: Start difference. First operand 110 states and 149 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-16 21:36:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:08,784 INFO L93 Difference]: Finished difference Result 212 states and 292 transitions. [2025-03-16 21:36:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 21:36:08,785 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-16 21:36:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:08,785 INFO L225 Difference]: With dead ends: 212 [2025-03-16 21:36:08,786 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 21:36:08,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:36:08,786 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 27 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:08,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 304 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 21:36:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-03-16 21:36:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2025-03-16 21:36:08,791 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 36 [2025-03-16 21:36:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:08,791 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2025-03-16 21:36:08,791 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-16 21:36:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2025-03-16 21:36:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 21:36:08,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,792 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-16 21:36:08,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:36:08,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1561478128, now seen corresponding path program 1 times [2025-03-16 21:36:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820538418] [2025-03-16 21:36:08,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:08,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 21:36:08,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 21:36:08,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:09,092 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-16 21:36:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820538418] [2025-03-16 21:36:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820538418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780783459] [2025-03-16 21:36:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:09,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:09,094 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-16 21:36:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:09,210 INFO L93 Difference]: Finished difference Result 210 states and 285 transitions. [2025-03-16 21:36:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-16 21:36:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:09,212 INFO L225 Difference]: With dead ends: 210 [2025-03-16 21:36:09,212 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 21:36:09,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-16 21:36:09,212 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:09,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 418 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 21:36:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 115. [2025-03-16 21:36:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 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-16 21:36:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2025-03-16 21:36:09,216 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 37 [2025-03-16 21:36:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2025-03-16 21:36:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 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-16 21:36:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2025-03-16 21:36:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 21:36:09,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:09,217 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-16 21:36:09,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:36:09,218 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2144539555, now seen corresponding path program 1 times [2025-03-16 21:36:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357600912] [2025-03-16 21:36:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:09,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 21:36:09,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 21:36:09,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:09,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:09,737 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-16 21:36:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357600912] [2025-03-16 21:36:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357600912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:09,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:36:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869536176] [2025-03-16 21:36:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:09,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:36:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:09,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:36:09,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:36:09,738 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) 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-16 21:36:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:09,900 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2025-03-16 21:36:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) 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-16 21:36:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:09,902 INFO L225 Difference]: With dead ends: 177 [2025-03-16 21:36:09,902 INFO L226 Difference]: Without dead ends: 119 [2025-03-16 21:36:09,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:36:09,903 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 60 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:09,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 190 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-16 21:36:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2025-03-16 21:36:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2025-03-16 21:36:09,906 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 153 transitions. Word has length 37 [2025-03-16 21:36:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:09,906 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 153 transitions. [2025-03-16 21:36:09,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) 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-16 21:36:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 153 transitions. [2025-03-16 21:36:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 21:36:09,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:09,907 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-16 21:36:09,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:36:09,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:09,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 178524461, now seen corresponding path program 1 times [2025-03-16 21:36:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754861877] [2025-03-16 21:36:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:09,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 21:36:09,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 21:36:09,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:09,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:10,273 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-16 21:36:10,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754861877] [2025-03-16 21:36:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754861877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:10,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 21:36:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494226930] [2025-03-16 21:36:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 21:36:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:10,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 21:36:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:36:10,274 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-16 21:36:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:10,507 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2025-03-16 21:36:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:36:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-16 21:36:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:10,508 INFO L225 Difference]: With dead ends: 185 [2025-03-16 21:36:10,508 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 21:36:10,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:36:10,509 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:10,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 290 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 21:36:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2025-03-16 21:36:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2025-03-16 21:36:10,514 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 38 [2025-03-16 21:36:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2025-03-16 21:36:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-16 21:36:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2025-03-16 21:36:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 21:36:10,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:10,515 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-16 21:36:10,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:36:10,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -655582525, now seen corresponding path program 1 times [2025-03-16 21:36:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-03-16 21:36:10,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:10,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 21:36:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 21:36:10,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:10,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:10,804 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-16 21:36:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-03-16 21:36:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557339435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354144088] [2025-03-16 21:36:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:10,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:10,807 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 8 states, 8 states have (on average 4.75) 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-16 21:36:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:10,953 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2025-03-16 21:36:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) 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-16 21:36:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:10,954 INFO L225 Difference]: With dead ends: 193 [2025-03-16 21:36:10,954 INFO L226 Difference]: Without dead ends: 113 [2025-03-16 21:36:10,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:36:10,955 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:10,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 257 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-16 21:36:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-16 21:36:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2025-03-16 21:36:10,958 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 38 [2025-03-16 21:36:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2025-03-16 21:36:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) 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-16 21:36:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2025-03-16 21:36:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 21:36:10,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:10,959 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, 1] [2025-03-16 21:36:10,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:36:10,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:10,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash 755204150, now seen corresponding path program 1 times [2025-03-16 21:36:10,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:10,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195144088] [2025-03-16 21:36:10,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:10,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:10,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 21:36:11,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 21:36:11,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:11,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:36:11,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:36:11,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 21:36:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 21:36:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:36:11,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:36:11,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:36:11,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:36:11,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:36:11,086 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:11,109 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:36:11,110 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:36:11,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:36:11,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:36:11 BoogieIcfgContainer [2025-03-16 21:36:11,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:36:11,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:36:11,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:36:11,122 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:36:11,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:03" (3/4) ... [2025-03-16 21:36:11,125 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:36:11,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:36:11,126 INFO L158 Benchmark]: Toolchain (without parser) took 8503.80ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 154.4MB in the beginning and 223.8MB in the end (delta: -69.4MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-03-16 21:36:11,126 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:11,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.79ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 141.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:36:11,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.10ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 136.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:36:11,127 INFO L158 Benchmark]: Boogie Preprocessor took 54.35ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 133.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:11,127 INFO L158 Benchmark]: IcfgBuilder took 479.59ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 103.0MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 21:36:11,127 INFO L158 Benchmark]: TraceAbstraction took 7688.82ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 102.6MB in the beginning and 223.9MB in the end (delta: -121.3MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2025-03-16 21:36:11,128 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 419.4MB. Free memory was 223.9MB in the beginning and 223.8MB in the end (delta: 101.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:11,129 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.42ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.79ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 141.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.10ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 136.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.35ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 133.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 479.59ms. Allocated memory is still 201.3MB. Free memory was 133.4MB in the beginning and 103.0MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7688.82ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 102.6MB in the beginning and 223.9MB in the end (delta: -121.3MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 419.4MB. Free memory was 223.9MB in the beginning and 223.8MB in the end (delta: 101.5kB). 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 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_13 = 1; [L34] const SORT_3 var_19 = 7; [L35] const SORT_3 var_23 = 1; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, var_13=1, var_19=7, var_23=1, var_4=0] [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=7, var_13=1, var_19=7, var_23=1, var_4=0] [L40] SORT_3 state_7 = __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_8_arg_1 = var_4; [L45] state_7 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-256, var_19=7, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_16_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_7; [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_23; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_18_arg_0 = state_5; [L72] SORT_3 var_18_arg_1 = state_7; [L73] SORT_1 var_18 = var_18_arg_0 > var_18_arg_1; [L74] SORT_3 var_20_arg_0 = state_7; [L75] SORT_3 var_20_arg_1 = var_19; [L76] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L77] SORT_1 var_21_arg_0 = var_18; [L78] SORT_1 var_21_arg_1 = var_20; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_21_arg_0=0, var_21_arg_1=1, var_23=1, var_24=1, var_25=1] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_24=1, var_25=1] [L79] SORT_1 var_21 = var_21_arg_0 | var_21_arg_1; [L80] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_24=1, var_25=1] [L80] var_21 = var_21 & mask_SORT_1 [L81] SORT_1 var_22_arg_0 = var_21; [L82] SORT_3 var_22_arg_1 = state_5; [L83] SORT_3 var_22_arg_2 = state_7; [L84] SORT_3 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_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_22; [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=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_26=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=0, state_7=0, var_13=1, var_19=7, var_23=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_7; [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_7; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_7; [L98] SORT_3 var_30_arg_1 = var_19; [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=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_31_arg_0=1, var_31_arg_1=1, var_33=0] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_33=0] [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=7, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=7, var_23=1, var_33=0] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_7; [L105] SORT_3 var_28_arg_1 = var_23; [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_7; [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=7, next_27_arg_1=1, var_13=1, var_19=7, var_23=1, var_34=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=7, next_27_arg_1=1, var_13=1, var_19=7, var_23=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_7 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_9_arg_0 = state_5; [L52] SORT_3 var_9_arg_1 = state_7; [L53] SORT_1 var_9 = var_9_arg_0 > var_9_arg_1; [L54] SORT_1 var_10_arg_0 = var_9; [L55] SORT_1 var_10 = ~var_10_arg_0; [L56] SORT_1 var_14_arg_0 = var_10; [L57] SORT_1 var_14 = ~var_14_arg_0; [L58] SORT_1 var_15_arg_0 = var_13; [L59] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-255, var_19=7, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_19=7, var_23=1] [L60] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L61] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=7, state_5=1, state_7=0, var_13=1, var_19=7, var_23=1] [L61] var_15 = var_15 & mask_SORT_1 [L62] SORT_1 bad_16_arg_0 = var_15; [L63] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 3113 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2463 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2110 IncrementalHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 650 mSDtfsCounter, 2110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=12, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 226 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 419 ConstructedInterpolants, 0 QuantifiedInterpolants, 2291 SizeOfPredicates, 5 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 62/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 21:36:11,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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.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 da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:36:13,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:36:13,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:36:13,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:36:13,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:36:13,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:36:13,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:36:13,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:36:13,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:36:13,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:36:13,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:36:13,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:36:13,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:36:13,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:13,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:36:13,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:36:13,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:36:13,218 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 -> da271682498909c2f25abbd0acdfd9a043f664f7a7cb078f9b27fc5caa97b14c [2025-03-16 21:36:13,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:36:13,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:36:13,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:36:13,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:36:13,485 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:36:13,486 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.c [2025-03-16 21:36:14,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48bf5b6b/48ff2485b66a401b900487197cf35fbb/FLAG239e9eed6 [2025-03-16 21:36:14,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:36:14,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2025-03-16 21:36:14,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48bf5b6b/48ff2485b66a401b900487197cf35fbb/FLAG239e9eed6 [2025-03-16 21:36:14,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48bf5b6b/48ff2485b66a401b900487197cf35fbb [2025-03-16 21:36:14,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:36:14,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:36:14,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:14,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:36:14,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:36:14,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:14" (1/1) ... [2025-03-16 21:36:14,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:14, skipping insertion in model container [2025-03-16 21:36:14,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:14" (1/1) ... [2025-03-16 21:36:14,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:36:14,977 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.c[1253,1266] [2025-03-16 21:36:15,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:15,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:36:15,037 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.c[1253,1266] [2025-03-16 21:36:15,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:15,061 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:36:15,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15 WrapperNode [2025-03-16 21:36:15,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:15,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:15,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:36:15,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:36:15,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,096 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-03-16 21:36:15,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:15,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:36:15,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:36:15,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:36:15,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,124 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:36:15,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:36:15,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:36:15,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:36:15,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:36:15,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (1/1) ... [2025-03-16 21:36:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:15,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:36:15,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:36:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:36:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:36:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:36:15,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:36:15,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:36:15,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:36:15,451 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-16 21:36:15,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:36:15,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:36:15,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:36:15,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:15 BoogieIcfgContainer [2025-03-16 21:36:15,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:36:15,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:36:15,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:36:15,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:36:15,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:36:14" (1/3) ... [2025-03-16 21:36:15,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4172eb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:15, skipping insertion in model container [2025-03-16 21:36:15,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:15" (2/3) ... [2025-03-16 21:36:15,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4172eb67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:15, skipping insertion in model container [2025-03-16 21:36:15,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:15" (3/3) ... [2025-03-16 21:36:15,469 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2025-03-16 21:36:15,481 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:36:15,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:36:15,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:36:15,523 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;@4dfa3bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:36:15,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:36:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:36:15,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:15,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:36:15,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:36:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:15,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450094758] [2025-03-16 21:36:15,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:15,554 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:36:15,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:36:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:36:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:15,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 21:36:15,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:15,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:36:15,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450094758] [2025-03-16 21:36:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450094758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:36:15,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169171387] [2025-03-16 21:36:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:15,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:15,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:15,821 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:15,855 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:36:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:15,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 21:36:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:15,861 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:36:15,861 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:36:15,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:15,865 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:15,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:36:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:36:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:36:15,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:36:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:15,885 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:36:15,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:36:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:36:15,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:15,887 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:36:15,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:36:16,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:16,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:36:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032129905] [2025-03-16 21:36:16,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:16,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:16,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:16,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:16,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 21:36:16,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:36:16,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:36:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:16,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 21:36:16,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:16,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:17,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032129905] [2025-03-16 21:36:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032129905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:17,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:36:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:36:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969618436] [2025-03-16 21:36:17,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:17,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:36:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:17,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:36:17,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:36:17,523 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:17,711 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-16 21:36:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:36:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 21:36:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:17,712 INFO L225 Difference]: With dead ends: 20 [2025-03-16 21:36:17,712 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 21:36:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:36:17,713 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:17,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 21:36:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-16 21:36:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-16 21:36:17,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2025-03-16 21:36:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-16 21:36:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-16 21:36:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 21:36:17,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:17,718 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-03-16 21:36:17,724 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-16 21:36:17,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:17,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1174864737, now seen corresponding path program 2 times [2025-03-16 21:36:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:17,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395828269] [2025-03-16 21:36:17,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:36:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:17,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:17,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 21:36:17,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 21:36:18,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 21:36:18,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:36:18,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:18,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 21:36:18,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:18,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:25,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395828269] [2025-03-16 21:36:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395828269] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:25,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:36:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-16 21:36:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265779441] [2025-03-16 21:36:25,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 21:36:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 21:36:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:36:25,784 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:27,046 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-16 21:36:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 21:36:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 21:36:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:27,048 INFO L225 Difference]: With dead ends: 38 [2025-03-16 21:36:27,048 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 21:36:27,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=284, Invalid=586, Unknown=0, NotChecked=0, Total=870 [2025-03-16 21:36:27,049 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:27,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 21:36:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-16 21:36:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 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-16 21:36:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2025-03-16 21:36:27,057 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 16 [2025-03-16 21:36:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:27,058 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2025-03-16 21:36:27,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2025-03-16 21:36:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 21:36:27,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:27,059 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1] [2025-03-16 21:36:27,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 21:36:27,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:27,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:27,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1005736927, now seen corresponding path program 3 times [2025-03-16 21:36:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325097301] [2025-03-16 21:36:27,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 21:36:27,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:27,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:27,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:27,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 21:36:27,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 11 equivalence classes. [2025-03-16 21:36:27,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 21:36:27,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-16 21:36:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:27,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-16 21:36:27,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 21:36:28,007 INFO L312 TraceCheckSpWp]: Computing backward predicates...