./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.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-?-798a7b3-m [2025-03-03 17:17:45,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:17:45,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:17:45,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:17:45,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:17:45,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:17:45,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:17:45,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:17:45,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:17:45,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:17:45,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:17:45,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:17:45,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:17:45,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:17:45,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:17:45,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:17:45,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:45,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:17:45,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:17:45,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:17:45,237 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-03 17:17:45,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:17:45,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:17:45,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:17:45,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:17:45,450 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:17:45,451 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-03 17:17:46,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6255d29a1/9d01a1314048473cb58186e4d3944945/FLAGd64f706b4 [2025-03-03 17:17:46,765 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:17:46,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2025-03-03 17:17:46,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6255d29a1/9d01a1314048473cb58186e4d3944945/FLAGd64f706b4 [2025-03-03 17:17:47,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6255d29a1/9d01a1314048473cb58186e4d3944945 [2025-03-03 17:17:47,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:17:47,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:17:47,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:47,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:17:47,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:17:47,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474c63f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47, skipping insertion in model container [2025-03-03 17:17:47,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:17:47,241 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-03 17:17:47,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:47,289 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:17:47,295 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-03 17:17:47,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:47,331 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:17:47,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47 WrapperNode [2025-03-03 17:17:47,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:47,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:47,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:17:47,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:17:47,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,383 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 187 [2025-03-03 17:17:47,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:47,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:17:47,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:17:47,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:17:47,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,424 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:17:47,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:17:47,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:17:47,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:17:47,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:17:47,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (1/1) ... [2025-03-03 17:17:47,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:47,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:17:47,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:17:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:17:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:17:47,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:17:47,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:17:47,559 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:17:47,560 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:17:47,912 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-03 17:17:47,913 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:17:47,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:17:47,938 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:17:47,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:47 BoogieIcfgContainer [2025-03-03 17:17:47,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:17:47,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:17:47,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:17:47,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:17:47,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:17:47" (1/3) ... [2025-03-03 17:17:47,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125a2fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:47, skipping insertion in model container [2025-03-03 17:17:47,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:47" (2/3) ... [2025-03-03 17:17:47,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125a2fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:47, skipping insertion in model container [2025-03-03 17:17:47,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:47" (3/3) ... [2025-03-03 17:17:47,945 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2025-03-03 17:17:47,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:17:47,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example.c that has 1 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:17:47,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:17:48,006 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;@79a5e58c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:17:48,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:17:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 17:17:48,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 773109631, now seen corresponding path program 1 times [2025-03-03 17:17:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140128054] [2025-03-03 17:17:48,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 17:17:48,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 17:17:48,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:48,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:48,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140128054] [2025-03-03 17:17:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140128054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:48,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:17:48,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499054159] [2025-03-03 17:17:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:17:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:48,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:17:48,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,362 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:48,412 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2025-03-03 17:17:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:17:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 17:17:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:48,417 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:17:48,417 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 17:17:48,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,421 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:48,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 17:17:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 17:17:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 17:17:48,470 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2025-03-03 17:17:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 17:17:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 17:17:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:17:48,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:17:48,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1798726028, now seen corresponding path program 1 times [2025-03-03 17:17:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500729724] [2025-03-03 17:17:48,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 17:17:48,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:17:48,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:48,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500729724] [2025-03-03 17:17:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500729724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:48,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:48,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:17:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786744804] [2025-03-03 17:17:48,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:48,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:17:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:48,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:17:48,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,575 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:48,627 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2025-03-03 17:17:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:17:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 17:17:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:48,628 INFO L225 Difference]: With dead ends: 90 [2025-03-03 17:17:48,628 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 17:17:48,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:48,629 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:48,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 17:17:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 17:17:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2025-03-03 17:17:48,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2025-03-03 17:17:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:48,637 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-03 17:17:48,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2025-03-03 17:17:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 17:17:48,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:48,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:48,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:17:48,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2005577242, now seen corresponding path program 1 times [2025-03-03 17:17:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:48,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746756990] [2025-03-03 17:17:48,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:48,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 17:17:48,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 17:17:48,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:48,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746756990] [2025-03-03 17:17:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746756990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:48,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:17:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165141751] [2025-03-03 17:17:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:48,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:17:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:48,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:17:48,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:17:48,872 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:48,997 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2025-03-03 17:17:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:17:49,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 17:17:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:49,000 INFO L225 Difference]: With dead ends: 119 [2025-03-03 17:17:49,001 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 17:17:49,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:49,002 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:49,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 229 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 17:17:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2025-03-03 17:17:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-03 17:17:49,010 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2025-03-03 17:17:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:49,010 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-03 17:17:49,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-03 17:17:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 17:17:49,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:49,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:49,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:17:49,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -737239294, now seen corresponding path program 1 times [2025-03-03 17:17:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:49,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323500451] [2025-03-03 17:17:49,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:49,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:49,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:17:49,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:17:49,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:49,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323500451] [2025-03-03 17:17:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323500451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:17:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820295679] [2025-03-03 17:17:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:49,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:17:49,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:17:49,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:17:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:17:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:49,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 17:17:49,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:17:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:49,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:17:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820295679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:49,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:17:49,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-03 17:17:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467169569] [2025-03-03 17:17:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:49,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:49,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:49,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:49,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:17:49,749 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:49,919 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2025-03-03 17:17:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:17:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 17:17:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:49,921 INFO L225 Difference]: With dead ends: 122 [2025-03-03 17:17:49,921 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 17:17:49,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:17:49,922 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 198 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-03 17:17:49,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 198 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 17:17:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2025-03-03 17:17:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2025-03-03 17:17:49,926 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 34 [2025-03-03 17:17:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:49,926 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2025-03-03 17:17:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2025-03-03 17:17:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:17:49,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:49,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:49,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:17:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:50,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:50,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash -983098412, now seen corresponding path program 1 times [2025-03-03 17:17:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:50,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828063154] [2025-03-03 17:17:50,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:50,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:17:50,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:17:50,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:50,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:50,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828063154] [2025-03-03 17:17:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828063154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:17:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009671285] [2025-03-03 17:17:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:50,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:17:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:17:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:17:50,509 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:50,678 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2025-03-03 17:17:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 17:17:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:50,679 INFO L225 Difference]: With dead ends: 135 [2025-03-03 17:17:50,679 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 17:17:50,679 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-03 17:17:50,680 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:50,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 236 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 17:17:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-03-03 17:17:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2025-03-03 17:17:50,689 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 35 [2025-03-03 17:17:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:50,689 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2025-03-03 17:17:50,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2025-03-03 17:17:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:17:50,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:50,690 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:50,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:17:50,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:50,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1525267089, now seen corresponding path program 1 times [2025-03-03 17:17:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598137445] [2025-03-03 17:17:50,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:17:50,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:17:50,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:50,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:51,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598137445] [2025-03-03 17:17:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598137445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:51,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800864844] [2025-03-03 17:17:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:51,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:51,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:51,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:51,014 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) 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-03 17:17:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:51,125 INFO L93 Difference]: Finished difference Result 173 states and 237 transitions. [2025-03-03 17:17:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) 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-03 17:17:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:51,127 INFO L225 Difference]: With dead ends: 173 [2025-03-03 17:17:51,127 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 17:17:51,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:17:51,127 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 59 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:51,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 378 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 17:17:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2025-03-03 17:17:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2025-03-03 17:17:51,132 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 36 [2025-03-03 17:17:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:51,132 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2025-03-03 17:17:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) 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-03 17:17:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2025-03-03 17:17:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:51,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:51,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:51,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:17:51,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1131215943, now seen corresponding path program 1 times [2025-03-03 17:17:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240283384] [2025-03-03 17:17:51,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:51,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:51,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:51,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:51,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:51,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:51,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240283384] [2025-03-03 17:17:51,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240283384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:51,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44898635] [2025-03-03 17:17:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:51,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:51,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:51,620 INFO L87 Difference]: Start difference. First operand 95 states and 127 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-03 17:17:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:51,764 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2025-03-03 17:17:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:17:51,765 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-03 17:17:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:51,765 INFO L225 Difference]: With dead ends: 185 [2025-03-03 17:17:51,765 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 17:17:51,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:51,766 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:51,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 154 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 17:17:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2025-03-03 17:17:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2025-03-03 17:17:51,777 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 37 [2025-03-03 17:17:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2025-03-03 17:17:51,778 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-03 17:17:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2025-03-03 17:17:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:51,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:51,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:17:51,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1086149374, now seen corresponding path program 1 times [2025-03-03 17:17:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-03-03 17:17:51,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:51,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:51,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:51,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:51,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-03-03 17:17:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096034626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:17:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745960300] [2025-03-03 17:17:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:52,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:17:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:52,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:17:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:17:52,240 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:52,469 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2025-03-03 17:17:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:17:52,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:17:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:52,471 INFO L225 Difference]: With dead ends: 192 [2025-03-03 17:17:52,471 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 17:17:52,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:17:52,472 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:52,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 186 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:17:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 17:17:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2025-03-03 17:17:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2025-03-03 17:17:52,484 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 37 [2025-03-03 17:17:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:52,484 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2025-03-03 17:17:52,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2025-03-03 17:17:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:17:52,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:52,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:52,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:17:52,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:52,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1769354677, now seen corresponding path program 1 times [2025-03-03 17:17:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175426527] [2025-03-03 17:17:52,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:17:52,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:17:52,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175426527] [2025-03-03 17:17:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175426527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:17:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824725253] [2025-03-03 17:17:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:17:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:17:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:17:52,711 INFO L87 Difference]: Start difference. First operand 121 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:52,785 INFO L93 Difference]: Finished difference Result 206 states and 281 transitions. [2025-03-03 17:17:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:17:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:17:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:52,786 INFO L225 Difference]: With dead ends: 206 [2025-03-03 17:17:52,786 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 17:17:52,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:17:52,789 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:52,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 17:17:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-03-03 17:17:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-03 17:17:52,797 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 37 [2025-03-03 17:17:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:52,797 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-03 17:17:52,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-03 17:17:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:17:52,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:52,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:52,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:17:52,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 837867173, now seen corresponding path program 1 times [2025-03-03 17:17:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121383297] [2025-03-03 17:17:52,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:52,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:17:52,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:17:52,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:52,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121383297] [2025-03-03 17:17:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121383297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581538773] [2025-03-03 17:17:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:53,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:53,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:53,069 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:53,200 INFO L93 Difference]: Finished difference Result 196 states and 267 transitions. [2025-03-03 17:17:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:53,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 17:17:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:53,201 INFO L225 Difference]: With dead ends: 196 [2025-03-03 17:17:53,201 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 17:17:53,201 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-03 17:17:53,202 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 56 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:53,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 405 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 17:17:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2025-03-03 17:17:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2025-03-03 17:17:53,205 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 38 [2025-03-03 17:17:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:53,205 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2025-03-03 17:17:53,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2025-03-03 17:17:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:17:53,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:53,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:17:53,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1048796566, now seen corresponding path program 1 times [2025-03-03 17:17:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106655257] [2025-03-03 17:17:53,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:53,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:17:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:17:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:53,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:53,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106655257] [2025-03-03 17:17:53,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106655257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:53,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:53,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:17:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308301296] [2025-03-03 17:17:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:53,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:17:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:53,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:17:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:17:53,709 INFO L87 Difference]: Start difference. First operand 105 states and 140 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:53,867 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2025-03-03 17:17:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:17:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 17:17:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:53,868 INFO L225 Difference]: With dead ends: 165 [2025-03-03 17:17:53,868 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 17:17:53,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-03 17:17:53,868 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:53,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 198 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 17:17:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-03-03 17:17:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 104 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2025-03-03 17:17:53,872 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 38 [2025-03-03 17:17:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2025-03-03 17:17:53,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2025-03-03 17:17:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:17:53,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:53,873 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-03 17:17:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:17:53,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 276827165, now seen corresponding path program 1 times [2025-03-03 17:17:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898777136] [2025-03-03 17:17:53,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:17:53,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:17:53,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:53,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:54,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:54,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898777136] [2025-03-03 17:17:54,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898777136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:54,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:54,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:17:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774138169] [2025-03-03 17:17:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:54,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:17:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:54,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:17:54,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:54,209 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:54,275 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2025-03-03 17:17:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:17:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 17:17:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:54,277 INFO L225 Difference]: With dead ends: 169 [2025-03-03 17:17:54,277 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 17:17:54,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:17:54,277 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:54,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 155 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 17:17:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 17:17:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 112 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-03 17:17:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 149 transitions. [2025-03-03 17:17:54,282 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 149 transitions. Word has length 39 [2025-03-03 17:17:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 149 transitions. [2025-03-03 17:17:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 149 transitions. [2025-03-03 17:17:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:17:54,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:54,284 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-03 17:17:54,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:17:54,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:54,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1243674995, now seen corresponding path program 1 times [2025-03-03 17:17:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556334211] [2025-03-03 17:17:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:54,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:17:54,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:17:54,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:17:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556334211] [2025-03-03 17:17:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556334211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:17:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845297141] [2025-03-03 17:17:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:54,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:17:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:17:54,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:17:54,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:17:54,641 INFO L87 Difference]: Start difference. First operand 113 states and 149 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:54,816 INFO L93 Difference]: Finished difference Result 179 states and 239 transitions. [2025-03-03 17:17:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:17:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 17:17:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:54,818 INFO L225 Difference]: With dead ends: 179 [2025-03-03 17:17:54,818 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 17:17:54,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:17:54,819 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:54,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 230 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:17:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 17:17:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-03-03 17:17:54,822 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-03 17:17:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2025-03-03 17:17:54,823 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 39 [2025-03-03 17:17:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:54,824 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2025-03-03 17:17:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2025-03-03 17:17:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:17:54,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:54,825 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, 1] [2025-03-03 17:17:54,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:17:54,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1783772054, now seen corresponding path program 1 times [2025-03-03 17:17:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:17:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630441476] [2025-03-03 17:17:54,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:17:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:17:54,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:17:54,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:54,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:17:54,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:17:54,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:17:54,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:17:54,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:54,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:17:54,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:17:54,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:17:54,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:17:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:17:54,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:54,939 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:17:54,941 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:17:54,947 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:17:54,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:17:54 BoogieIcfgContainer [2025-03-03 17:17:54,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:17:54,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:17:54,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:17:54,953 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:17:54,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:47" (3/4) ... [2025-03-03 17:17:54,955 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:17:54,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:17:54,956 INFO L158 Benchmark]: Toolchain (without parser) took 7826.25ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.8MB in the beginning and 185.3MB in the end (delta: -62.5MB). Peak memory consumption was 145.8MB. Max. memory is 16.1GB. [2025-03-03 17:17:54,957 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:17:54,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.35ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:17:54,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.78ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 104.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:17:54,957 INFO L158 Benchmark]: Boogie Preprocessor took 63.52ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:17:54,957 INFO L158 Benchmark]: IcfgBuilder took 487.55ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 71.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:17:54,958 INFO L158 Benchmark]: TraceAbstraction took 7012.25ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 70.8MB in the beginning and 185.3MB in the end (delta: -114.6MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2025-03-03 17:17:54,958 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 377.5MB. Free memory was 185.3MB in the beginning and 185.3MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:17:54,959 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.19ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.35ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 109.3MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.78ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 104.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.52ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 487.55ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 71.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7012.25ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 70.8MB in the beginning and 185.3MB in the end (delta: -114.6MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 377.5MB. Free memory was 185.3MB in the beginning and 185.3MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 2871 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2228 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1784 IncrementalHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 643 mSDtfsCounter, 1784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=8, InterpolantAutomatonStates: 93, 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, 164 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 2241 SizeOfPredicates, 4 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 45 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-03 17:17:54,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.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-?-798a7b3-m [2025-03-03 17:17:56,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:17:56,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:17:56,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:17:56,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:17:57,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:17:57,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:17:57,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:17:57,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:17:57,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:17:57,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:17:57,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:17:57,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:17:57,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:17:57,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:17:57,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:17:57,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:17:57,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:57,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:17:57,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:17:57,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:17:57,006 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-03 17:17:57,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:17:57,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:17:57,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:17:57,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:17:57,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:17:57,263 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-03 17:17:58,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8d48715/b649ebbd4cc14c7899f8f10b333b263b/FLAG7780cc403 [2025-03-03 17:17:58,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:17:58,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c [2025-03-03 17:17:58,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8d48715/b649ebbd4cc14c7899f8f10b333b263b/FLAG7780cc403 [2025-03-03 17:17:58,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8d48715/b649ebbd4cc14c7899f8f10b333b263b [2025-03-03 17:17:58,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:17:58,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:17:58,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:58,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:17:58,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:17:58,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142b5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58, skipping insertion in model container [2025-03-03 17:17:58,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:17:58,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example.c[1253,1266] [2025-03-03 17:17:58,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:58,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:17:58,884 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-03 17:17:58,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:17:58,907 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:17:58,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58 WrapperNode [2025-03-03 17:17:58,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:17:58,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:58,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:17:58,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:17:58,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,942 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-03-03 17:17:58,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:17:58,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:17:58,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:17:58,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:17:58,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,960 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:17:58,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:17:58,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:17:58,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:17:58,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:17:58,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (1/1) ... [2025-03-03 17:17:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:17:59,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:59,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:17:59,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:17:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:17:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:17:59,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:17:59,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:17:59,108 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:17:59,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:17:59,267 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 17:17:59,267 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:17:59,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:17:59,272 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:17:59,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:59 BoogieIcfgContainer [2025-03-03 17:17:59,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:17:59,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:17:59,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:17:59,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:17:59,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:17:58" (1/3) ... [2025-03-03 17:17:59,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352edca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:59, skipping insertion in model container [2025-03-03 17:17:59,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:17:58" (2/3) ... [2025-03-03 17:17:59,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352edca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:17:59, skipping insertion in model container [2025-03-03 17:17:59,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:17:59" (3/3) ... [2025-03-03 17:17:59,281 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example.c [2025-03-03 17:17:59,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:17:59,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:17:59,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:17:59,338 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;@9b0e79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:17:59,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:17:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:17:59,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:59,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:17:59,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:59,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:17:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:17:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731117981] [2025-03-03 17:17:59,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:59,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:17:59,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:17:59,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:17:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:17:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:59,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:59,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:17:59,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:17:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:17:59,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:17:59,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:17:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731117981] [2025-03-03 17:17:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731117981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:17:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:17:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:17:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096383178] [2025-03-03 17:17:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:17:59,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:17:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:17:59,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:17:59,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:17:59,636 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:17:59,668 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:17:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:17:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:17:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:17:59,676 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:17:59,676 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:17:59,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:17:59,681 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:17:59,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:17:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:17:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:17:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:17:59,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:17:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:17:59,705 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:17:59,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:17:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:17:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:17:59,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:17:59,705 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:17:59,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:17:59,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:59,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:17:59,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:17:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:17:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:17:59,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516694793] [2025-03-03 17:17:59,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:17:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:17:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:17:59,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:17:59,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:17:59,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:17:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:17:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:17:59,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:17:59,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 17:18:00,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:00,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:18:01,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:18:01,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516694793] [2025-03-03 17:18:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516694793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:01,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:18:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:18:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255097887] [2025-03-03 17:18:01,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:01,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:18:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:18:01,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:18:01,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:18:01,350 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:01,545 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-03 17:18:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:18:01,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:18:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:01,546 INFO L225 Difference]: With dead ends: 21 [2025-03-03 17:18:01,546 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 17:18:01,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:18:01,547 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:18:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 17:18:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-03 17:18:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-03 17:18:01,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-03 17:18:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-03 17:18:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-03 17:18:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 17:18:01,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:01,554 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-03 17:18:01,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:18:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:01,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -209850681, now seen corresponding path program 2 times [2025-03-03 17:18:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421520106] [2025-03-03 17:18:01,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:18:01,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:01,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:01,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:18:01,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:18:01,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 17:18:01,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 17:18:01,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:18:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 17:18:01,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:02,140 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-03 17:18:02,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:18:08,980 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-03 17:18:08,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:18:08,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421520106] [2025-03-03 17:18:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421520106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:18:08,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:18:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-03 17:18:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766244861] [2025-03-03 17:18:08,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:18:08,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 17:18:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:18:08,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 17:18:08,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:18:08,983 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:18:10,177 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-03 17:18:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 17:18:10,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 17:18:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:18:10,179 INFO L225 Difference]: With dead ends: 39 [2025-03-03 17:18:10,179 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 17:18:10,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=255, Invalid=501, Unknown=0, NotChecked=0, Total=756 [2025-03-03 17:18:10,180 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:18:10,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:18:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 17:18:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-03 17:18:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-03-03 17:18:10,187 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2025-03-03 17:18:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:18:10,187 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-03-03 17:18:10,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:18:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-03-03 17:18:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:18:10,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:18:10,188 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2025-03-03 17:18:10,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 17:18:10,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:10,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:18:10,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:18:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1729114553, now seen corresponding path program 3 times [2025-03-03 17:18:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:18:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273722662] [2025-03-03 17:18:10,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 17:18:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:18:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:18:10,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:18:10,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:18:10,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-03 17:18:10,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:18:10,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 17:18:10,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:18:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-03 17:18:10,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:18:11,133 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-03 17:18:11,134 INFO L312 TraceCheckSpWp]: Computing backward predicates...