./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.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.paper_v3.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 1a93b4c325da61bdb0bcf5f7bfce47877e5238073f7401e4883b579f193ca117 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:56:04,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:56:04,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:56:04,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:56:04,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:56:04,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:56:04,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:56:04,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:56:04,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:56:04,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:56:04,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:56:04,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:56:04,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:56:04,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:56:04,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:56:04,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:56:04,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:56:04,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:56:04,488 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 -> 1a93b4c325da61bdb0bcf5f7bfce47877e5238073f7401e4883b579f193ca117 [2025-03-03 17:56:04,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:56:04,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:56:04,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:56:04,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:56:04,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:56:04,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:05,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79845d21c/a597645e992e417cb79eef0f60728989/FLAGeccb08c71 [2025-03-03 17:56:06,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:56:06,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:06,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79845d21c/a597645e992e417cb79eef0f60728989/FLAGeccb08c71 [2025-03-03 17:56:06,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79845d21c/a597645e992e417cb79eef0f60728989 [2025-03-03 17:56:06,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:56:06,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:56:06,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:56:06,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:56:06,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:56:06,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aae2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06, skipping insertion in model container [2025-03-03 17:56:06,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:56:06,340 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.paper_v3.c[1248,1261] [2025-03-03 17:56:06,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:56:06,386 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:56:06,394 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.paper_v3.c[1248,1261] [2025-03-03 17:56:06,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:56:06,419 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:56:06,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06 WrapperNode [2025-03-03 17:56:06,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:56:06,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:56:06,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:56:06,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:56:06,426 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:56:06" (1/1) ... [2025-03-03 17:56:06,435 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:56:06" (1/1) ... [2025-03-03 17:56:06,478 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 187 [2025-03-03 17:56:06,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:56:06,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:56:06,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:56:06,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:56:06,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,512 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:56:06,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:56:06,535 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:56:06,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:56:06,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:56:06,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (1/1) ... [2025-03-03 17:56:06,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:56:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:06,563 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:56:06,565 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:56:06,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:56:06,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:56:06,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:56:06,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:56:06,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:56:06,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:56:06,983 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-03 17:56:06,983 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:56:07,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:56:07,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:56:07,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:56:07 BoogieIcfgContainer [2025-03-03 17:56:07,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:56:07,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:56:07,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:56:07,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:56:07,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:56:06" (1/3) ... [2025-03-03 17:56:07,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54688be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:56:07, skipping insertion in model container [2025-03-03 17:56:07,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:06" (2/3) ... [2025-03-03 17:56:07,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54688be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:56:07, skipping insertion in model container [2025-03-03 17:56:07,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:56:07" (3/3) ... [2025-03-03 17:56:07,022 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:07,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:56:07,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.paper_v3.c that has 1 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:56:07,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:56:07,088 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;@27857292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:56:07,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:56:07,093 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:56:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 17:56:07,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:07,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:56:07,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:07,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 773109631, now seen corresponding path program 1 times [2025-03-03 17:56:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:07,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644042261] [2025-03-03 17:56:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 17:56:07,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 17:56:07,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:07,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:07,489 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:56:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644042261] [2025-03-03 17:56:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644042261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:56:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175278297] [2025-03-03 17:56:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:56:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:56:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:56:07,512 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:56:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:07,579 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2025-03-03 17:56:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:56:07,582 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:56:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:07,586 INFO L225 Difference]: With dead ends: 89 [2025-03-03 17:56:07,587 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 17:56:07,589 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:56:07,590 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:56:07,591 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:56:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 17:56:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 17:56:07,614 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:56:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-03-03 17:56:07,618 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2025-03-03 17:56:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:07,619 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-03-03 17:56:07,619 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:56:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-03-03 17:56:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:56:07,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:07,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:56:07,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:56:07,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:07,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1798726028, now seen corresponding path program 1 times [2025-03-03 17:56:07,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:07,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687055374] [2025-03-03 17:56:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:07,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 17:56:07,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:56:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:07,744 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:56:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:07,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687055374] [2025-03-03 17:56:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687055374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:07,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:07,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:56:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887692028] [2025-03-03 17:56:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:07,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:56:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:07,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:56:07,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:56:07,747 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:56:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:07,800 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2025-03-03 17:56:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:56:07,801 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:56:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:07,802 INFO L225 Difference]: With dead ends: 90 [2025-03-03 17:56:07,802 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 17:56:07,802 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:56:07,803 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:56:07,804 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:56:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 17:56:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 17:56:07,808 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:56:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2025-03-03 17:56:07,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2025-03-03 17:56:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:07,810 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-03-03 17:56:07,810 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:56:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2025-03-03 17:56:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 17:56:07,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:07,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:56:07,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:56:07,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:07,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2005577242, now seen corresponding path program 1 times [2025-03-03 17:56:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:07,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503051614] [2025-03-03 17:56:07,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:07,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 17:56:07,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 17:56:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:08,090 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:56:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503051614] [2025-03-03 17:56:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503051614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:56:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041479782] [2025-03-03 17:56:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:56:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:08,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:56:08,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:56:08,093 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:56:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:08,208 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2025-03-03 17:56:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:56:08,209 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:56:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:08,210 INFO L225 Difference]: With dead ends: 119 [2025-03-03 17:56:08,210 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 17:56:08,210 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:56:08,211 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:56:08,211 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:56:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 17:56:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2025-03-03 17:56:08,214 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:56:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-03 17:56:08,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2025-03-03 17:56:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-03 17:56:08,215 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:56:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-03 17:56:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 17:56:08,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:08,215 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:56:08,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:56:08,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:08,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -737239294, now seen corresponding path program 1 times [2025-03-03 17:56:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-03 17:56:08,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:08,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:56:08,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:56:08,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:08,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:08,603 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:56:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-03 17:56:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638212283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:56:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297088580] [2025-03-03 17:56:08,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:56:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:08,605 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:56:08,607 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:56:08,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 17:56:08,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 17:56:08,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 17:56:08,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:56:08,914 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:56:08,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:56:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297088580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:56:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-03 17:56:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70724689] [2025-03-03 17:56:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:56:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:08,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:56:08,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:56:08,915 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:56:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:09,093 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2025-03-03 17:56:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:56:09,093 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:56:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:09,094 INFO L225 Difference]: With dead ends: 122 [2025-03-03 17:56:09,095 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 17:56:09,095 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:56:09,095 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:56:09,096 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:56:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 17:56:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2025-03-03 17:56:09,103 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:56:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2025-03-03 17:56:09,104 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 34 [2025-03-03 17:56:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2025-03-03 17:56:09,104 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:56:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2025-03-03 17:56:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:56:09,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:09,106 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:56:09,113 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:56:09,306 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:56:09,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:09,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash -983098412, now seen corresponding path program 1 times [2025-03-03 17:56:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848710829] [2025-03-03 17:56:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:09,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 17:56:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:56:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:09,694 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:56:09,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848710829] [2025-03-03 17:56:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848710829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:56:09,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187517275] [2025-03-03 17:56:09,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:56:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:09,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:56:09,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:56:09,697 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:09,821 INFO L93 Difference]: Finished difference Result 154 states and 212 transitions. [2025-03-03 17:56:09,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:56:09,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 17:56:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:09,822 INFO L225 Difference]: With dead ends: 154 [2025-03-03 17:56:09,822 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 17:56:09,823 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:56:09,823 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 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:56:09,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 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:56:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 17:56:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 76. [2025-03-03 17:56:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2025-03-03 17:56:09,832 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2025-03-03 17:56:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:09,832 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2025-03-03 17:56:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2025-03-03 17:56:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:56:09,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:09,834 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:56:09,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:56:09,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1581135146, now seen corresponding path program 1 times [2025-03-03 17:56:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231189121] [2025-03-03 17:56:09,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:56:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:56:09,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:09,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:10,338 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:56:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231189121] [2025-03-03 17:56:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231189121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:56:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382724016] [2025-03-03 17:56:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:56:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:10,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:56:10,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:56:10,340 INFO L87 Difference]: Start difference. First operand 76 states and 102 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:56:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:10,436 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2025-03-03 17:56:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:56:10,437 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:56:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:10,438 INFO L225 Difference]: With dead ends: 163 [2025-03-03 17:56:10,438 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 17:56:10,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:56:10,439 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:10,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 168 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 17:56:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2025-03-03 17:56:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 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:56:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2025-03-03 17:56:10,448 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 36 [2025-03-03 17:56:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2025-03-03 17:56:10,448 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:56:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2025-03-03 17:56:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 17:56:10,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:10,449 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:56:10,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:56:10,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:10,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1773683143, now seen corresponding path program 1 times [2025-03-03 17:56:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671169153] [2025-03-03 17:56:10,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 17:56:10,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 17:56:10,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:10,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:10,785 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:56:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671169153] [2025-03-03 17:56:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671169153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:56:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596489237] [2025-03-03 17:56:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:56:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:10,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:56:10,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:56:10,787 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:10,943 INFO L93 Difference]: Finished difference Result 197 states and 274 transitions. [2025-03-03 17:56:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:56:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 17:56:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:10,944 INFO L225 Difference]: With dead ends: 197 [2025-03-03 17:56:10,944 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 17:56:10,944 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:56:10,946 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:10,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 17:56:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2025-03-03 17:56:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.373913043478261) internal successors, (158), 115 states have internal predecessors, (158), 0 states have call successors, (0), 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:56:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2025-03-03 17:56:10,952 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 36 [2025-03-03 17:56:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:10,952 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2025-03-03 17:56:10,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2025-03-03 17:56:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:56:10,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:10,953 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:56:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:56:10,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:10,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1131215943, now seen corresponding path program 1 times [2025-03-03 17:56:10,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675493113] [2025-03-03 17:56:10,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:10,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:56:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:56:11,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:11,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:11,433 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:56:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:11,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675493113] [2025-03-03 17:56:11,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675493113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:11,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:11,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:56:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928372088] [2025-03-03 17:56:11,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:11,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:56:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:11,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:56:11,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:56:11,435 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:11,517 INFO L93 Difference]: Finished difference Result 180 states and 248 transitions. [2025-03-03 17:56:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:56:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:56:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:11,518 INFO L225 Difference]: With dead ends: 180 [2025-03-03 17:56:11,518 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 17:56:11,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:56:11,519 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:11,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 148 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 17:56:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-03-03 17:56:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 119 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2025-03-03 17:56:11,524 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 37 [2025-03-03 17:56:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2025-03-03 17:56:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2025-03-03 17:56:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 17:56:11,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:11,528 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:56:11,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:56:11,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:11,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1086149374, now seen corresponding path program 1 times [2025-03-03 17:56:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721100731] [2025-03-03 17:56:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 17:56:11,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 17:56:11,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:11,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:11,903 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:56:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:11,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721100731] [2025-03-03 17:56:11,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721100731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:11,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:11,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:56:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546911668] [2025-03-03 17:56:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:11,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:56:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:11,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:56:11,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:56:11,906 INFO L87 Difference]: Start difference. First operand 120 states and 164 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:12,018 INFO L93 Difference]: Finished difference Result 190 states and 261 transitions. [2025-03-03 17:56:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:56:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 17:56:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:12,019 INFO L225 Difference]: With dead ends: 190 [2025-03-03 17:56:12,019 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 17:56:12,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:56:12,020 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 43 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:12,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 172 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 17:56:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-03 17:56:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 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:56:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2025-03-03 17:56:12,028 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 37 [2025-03-03 17:56:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2025-03-03 17:56:12,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:56:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2025-03-03 17:56:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:56:12,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:12,031 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:56:12,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:56:12,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 837867173, now seen corresponding path program 1 times [2025-03-03 17:56:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321343444] [2025-03-03 17:56:12,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:12,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:56:12,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:56:12,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:12,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:12,293 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:56:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321343444] [2025-03-03 17:56:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321343444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:56:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032636944] [2025-03-03 17:56:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:56:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:56:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:56:12,294 INFO L87 Difference]: Start difference. First operand 120 states and 162 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:56:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:12,406 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2025-03-03 17:56:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:56:12,407 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:56:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:12,408 INFO L225 Difference]: With dead ends: 214 [2025-03-03 17:56:12,408 INFO L226 Difference]: Without dead ends: 160 [2025-03-03 17:56:12,408 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:56:12,408 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 55 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:12,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 430 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-03 17:56:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2025-03-03 17:56:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 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:56:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2025-03-03 17:56:12,414 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 38 [2025-03-03 17:56:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:12,414 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2025-03-03 17:56:12,414 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:56:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2025-03-03 17:56:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:56:12,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:12,415 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:56:12,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:56:12,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:12,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1048796566, now seen corresponding path program 1 times [2025-03-03 17:56:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226008751] [2025-03-03 17:56:12,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:12,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:56:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:56:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:12,846 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:56:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226008751] [2025-03-03 17:56:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226008751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:56:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456449170] [2025-03-03 17:56:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:56:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:12,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:56:12,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:56:12,847 INFO L87 Difference]: Start difference. First operand 123 states and 166 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:56:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:13,011 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2025-03-03 17:56:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:56:13,012 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:56:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:13,012 INFO L225 Difference]: With dead ends: 192 [2025-03-03 17:56:13,012 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 17:56:13,013 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:56:13,013 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:13,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 217 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 17:56:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2025-03-03 17:56:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 0 states have call successors, (0), 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:56:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 174 transitions. [2025-03-03 17:56:13,016 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 174 transitions. Word has length 38 [2025-03-03 17:56:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:13,016 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 174 transitions. [2025-03-03 17:56:13,017 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:56:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 174 transitions. [2025-03-03 17:56:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 17:56:13,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:13,017 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:56:13,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:56:13,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash -351046352, now seen corresponding path program 1 times [2025-03-03 17:56:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248986283] [2025-03-03 17:56:13,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:13,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 17:56:13,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 17:56:13,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:13,179 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:56:13,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248986283] [2025-03-03 17:56:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248986283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:56:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231442692] [2025-03-03 17:56:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:56:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:13,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:56:13,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:56:13,181 INFO L87 Difference]: Start difference. First operand 129 states and 174 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:56:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:13,234 INFO L93 Difference]: Finished difference Result 217 states and 293 transitions. [2025-03-03 17:56:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:56:13,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:56:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:13,235 INFO L225 Difference]: With dead ends: 217 [2025-03-03 17:56:13,235 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 17:56:13,236 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:56:13,236 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:56:13,237 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:56:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 17:56:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-03 17:56:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 0 states have call successors, (0), 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:56:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2025-03-03 17:56:13,240 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 38 [2025-03-03 17:56:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:13,240 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2025-03-03 17:56:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:56:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2025-03-03 17:56:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:56:13,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:13,241 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:56:13,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:56:13,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 276827165, now seen corresponding path program 1 times [2025-03-03 17:56:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-03-03 17:56:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:13,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:56:13,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:56:13,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:13,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:13,784 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:56:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-03-03 17:56:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782163896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:13,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:13,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:56:13,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012129898] [2025-03-03 17:56:13,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:13,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:56:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:13,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:56:13,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:56:13,787 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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:56:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:14,001 INFO L93 Difference]: Finished difference Result 175 states and 236 transitions. [2025-03-03 17:56:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:56:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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:56:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:14,002 INFO L225 Difference]: With dead ends: 175 [2025-03-03 17:56:14,002 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 17:56:14,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:56:14,003 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:14,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 274 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:56:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 17:56:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-03 17:56:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 0 states have call successors, (0), 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:56:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-03 17:56:14,009 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 39 [2025-03-03 17:56:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:14,010 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-03 17:56:14,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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:56:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-03 17:56:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:56:14,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:14,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, 1, 1, 1, 1, 1] [2025-03-03 17:56:14,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:56:14,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1243674995, now seen corresponding path program 1 times [2025-03-03 17:56:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589871484] [2025-03-03 17:56:14,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:14,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:56:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:56:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:14,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:14,302 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:56:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:56:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589871484] [2025-03-03 17:56:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589871484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:14,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:14,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:56:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31255364] [2025-03-03 17:56:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:14,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:56:14,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:56:14,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:56:14,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:56:14,305 INFO L87 Difference]: Start difference. First operand 111 states and 146 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:56:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:14,456 INFO L93 Difference]: Finished difference Result 173 states and 232 transitions. [2025-03-03 17:56:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:56:14,456 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:56:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:14,457 INFO L225 Difference]: With dead ends: 173 [2025-03-03 17:56:14,457 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 17:56:14,457 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:56:14,458 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:56:14,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 232 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:56:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 17:56:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-03 17:56:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.309090909090909) internal successors, (144), 110 states have internal predecessors, (144), 0 states have call successors, (0), 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:56:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2025-03-03 17:56:14,461 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 39 [2025-03-03 17:56:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:14,461 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2025-03-03 17:56:14,461 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:56:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2025-03-03 17:56:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:56:14,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:14,461 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:56:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:56:14,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:14,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1783772054, now seen corresponding path program 1 times [2025-03-03 17:56:14,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:56:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914883733] [2025-03-03 17:56:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:56:14,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:56:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:56:14,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:14,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:56:14,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:56:14,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:56:14,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:56:14,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:14,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:56:14,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:56:14,565 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:56:14,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:56:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:56:14,570 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:56:14,591 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:56:14,593 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:56:14,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:56:14,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:56:14 BoogieIcfgContainer [2025-03-03 17:56:14,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:56:14,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:56:14,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:56:14,605 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:56:14,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:56:07" (3/4) ... [2025-03-03 17:56:14,607 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:56:14,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:56:14,609 INFO L158 Benchmark]: Toolchain (without parser) took 8387.64ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 105.2MB in the beginning and 231.6MB in the end (delta: -126.3MB). Peak memory consumption was 252.3MB. Max. memory is 16.1GB. [2025-03-03 17:56:14,609 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:56:14,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.46ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:56:14,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.52ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:56:14,609 INFO L158 Benchmark]: Boogie Preprocessor took 55.89ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:56:14,609 INFO L158 Benchmark]: IcfgBuilder took 479.08ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 53.8MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 17:56:14,610 INFO L158 Benchmark]: TraceAbstraction took 7588.02ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 53.8MB in the beginning and 231.7MB in the end (delta: -177.9MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. [2025-03-03 17:56:14,610 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 520.1MB. Free memory was 231.7MB in the beginning and 231.6MB in the end (delta: 133.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:56:14,611 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.30ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.46ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.52ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 87.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.89ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 479.08ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 53.8MB in the end (delta: 30.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7588.02ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 53.8MB in the beginning and 231.7MB in the end (delta: -177.9MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 520.1MB. Free memory was 231.7MB in the beginning and 231.6MB in the end (delta: 133.9kB). 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 89, overapproximation of bitwiseAnd at line 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_13 = 1; [L34] const SORT_3 var_19 = 255; [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=255, var_13=1, var_19=255, 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=255, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-256, var_19=255, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, state_5=0, state_7=0, var_13=1, var_19=255, var_23=1, var_26=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, next_27_arg_1=1, state_5=0, state_7=0, var_13=1, var_19=255, 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=255, next_27_arg_1=1, var_13=1, var_19=255, var_23=1, var_34=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=255, next_27_arg_1=1, var_13=1, var_19=255, 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=255, state_5=1, state_7=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-255, var_19=255, var_23=1] [L60] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=255, state_5=1, state_7=0, var_13=1, var_19=255, 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=255, state_5=1, state_7=0, var_13=1, var_19=255, 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: 7.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 520 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 3206 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2515 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2048 IncrementalHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 691 mSDtfsCounter, 2048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=11, InterpolantAutomatonStates: 99, 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, 14 MinimizatonAttempts, 155 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 2733 SizeOfPredicates, 4 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 68/72 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:56:14,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.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 1a93b4c325da61bdb0bcf5f7bfce47877e5238073f7401e4883b579f193ca117 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:56:16,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:56:16,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:56:16,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:56:16,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:56:16,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:56:16,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:56:16,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:56:16,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:56:16,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:56:16,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:56:16,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:56:16,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:56:16,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:56:16,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:56:16,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:56:16,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:56:16,554 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 -> 1a93b4c325da61bdb0bcf5f7bfce47877e5238073f7401e4883b579f193ca117 [2025-03-03 17:56:16,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:56:16,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:56:16,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:56:16,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:56:16,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:56:16,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:17,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37acdd273/dac041133af6425bb15cb00a3abbb04a/FLAGa68bf93b7 [2025-03-03 17:56:18,079 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:56:18,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:18,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37acdd273/dac041133af6425bb15cb00a3abbb04a/FLAGa68bf93b7 [2025-03-03 17:56:18,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37acdd273/dac041133af6425bb15cb00a3abbb04a [2025-03-03 17:56:18,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:56:18,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:56:18,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:56:18,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:56:18,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:56:18,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2076fad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18, skipping insertion in model container [2025-03-03 17:56:18,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:56:18,226 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.paper_v3.c[1248,1261] [2025-03-03 17:56:18,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:56:18,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:56:18,270 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.paper_v3.c[1248,1261] [2025-03-03 17:56:18,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:56:18,294 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:56:18,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18 WrapperNode [2025-03-03 17:56:18,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:56:18,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:56:18,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:56:18,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:56:18,299 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:56:18" (1/1) ... [2025-03-03 17:56:18,305 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:56:18" (1/1) ... [2025-03-03 17:56:18,322 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-03-03 17:56:18,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:56:18,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:56:18,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:56:18,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:56:18,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,354 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:56:18,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:56:18,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:56:18,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:56:18,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:56:18,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (1/1) ... [2025-03-03 17:56:18,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:56:18,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:18,401 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:56:18,404 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:56:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:56:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:56:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:56:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:56:18,490 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:56:18,491 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:56:18,618 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 17:56:18,618 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:56:18,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:56:18,626 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:56:18,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:56:18 BoogieIcfgContainer [2025-03-03 17:56:18,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:56:18,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:56:18,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:56:18,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:56:18,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:56:18" (1/3) ... [2025-03-03 17:56:18,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9402097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:56:18, skipping insertion in model container [2025-03-03 17:56:18,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:56:18" (2/3) ... [2025-03-03 17:56:18,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9402097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:56:18, skipping insertion in model container [2025-03-03 17:56:18,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:56:18" (3/3) ... [2025-03-03 17:56:18,632 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.paper_v3.c [2025-03-03 17:56:18,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:56:18,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.paper_v3.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:56:18,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:56:18,680 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;@4bcf535f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:56:18,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:56:18,683 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:56:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:56:18,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:18,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:56:18,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:56:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:56:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635096704] [2025-03-03 17:56:18,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:56:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:18,700 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:56:18,702 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:56:18,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:56:18,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:56:18,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:18,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:18,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:56:18,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:56:18,966 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:56:18,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:56:18,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:56:18,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635096704] [2025-03-03 17:56:18,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635096704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:56:18,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:56:18,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:56:18,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121338292] [2025-03-03 17:56:18,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:56:18,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:56:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:56:18,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:56:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:56:18,988 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:56:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:19,019 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:56:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:56:19,020 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:56:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:19,024 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:56:19,024 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:56:19,028 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:56:19,030 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:56:19,031 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:56:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:56:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:56:19,047 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:56:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:56:19,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:56:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:19,053 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:56:19,053 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:56:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:56:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:56:19,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:19,053 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:56:19,059 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:56:19,258 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:56:19,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:56:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:56:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424704758] [2025-03-03 17:56:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:56:19,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:56:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:19,261 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:56:19,262 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:56:19,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:56:19,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:56:19,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:56:19,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:19,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 17:56:19,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:56:19,546 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:56:19,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:56:20,659 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:56:20,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:56:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424704758] [2025-03-03 17:56:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424704758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:56:20,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:56:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:56:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630198340] [2025-03-03 17:56:20,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:56:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:56:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:56:20,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:56:20,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:56:20,664 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:56:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:20,862 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-03 17:56:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:56:20,863 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:56:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:20,863 INFO L225 Difference]: With dead ends: 21 [2025-03-03 17:56:20,863 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 17:56:20,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:56:20,864 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:56:20,864 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:56:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 17:56:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-03 17:56:20,868 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:56:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-03 17:56:20,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-03 17:56:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-03 17:56:20,869 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:56:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-03 17:56:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 17:56:20,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:20,871 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-03 17:56:20,877 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:56:21,075 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:56:21,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:21,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -209850681, now seen corresponding path program 2 times [2025-03-03 17:56:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:56:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528187574] [2025-03-03 17:56:21,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:56:21,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:56:21,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:21,078 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:56:21,081 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:56:21,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 17:56:21,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 17:56:21,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:56:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:21,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 17:56:21,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:56:21,503 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:56:21,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:56:28,045 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:56:28,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:56:28,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528187574] [2025-03-03 17:56:28,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528187574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:56:28,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:56:28,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-03 17:56:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942316835] [2025-03-03 17:56:28,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:56:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 17:56:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:56:28,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 17:56:28,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:56:28,047 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:56:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:56:29,197 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-03 17:56:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 17:56:29,197 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:56:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:56:29,198 INFO L225 Difference]: With dead ends: 39 [2025-03-03 17:56:29,199 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 17:56:29,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=255, Invalid=501, Unknown=0, NotChecked=0, Total=756 [2025-03-03 17:56:29,200 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:56:29,200 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:56:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 17:56:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2025-03-03 17:56:29,207 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:56:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-03-03 17:56:29,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2025-03-03 17:56:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:56:29,208 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-03-03 17:56:29,208 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:56:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-03-03 17:56:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 17:56:29,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:56:29,209 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2025-03-03 17:56:29,214 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:56:29,409 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:56:29,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:56:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:56:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1729114553, now seen corresponding path program 3 times [2025-03-03 17:56:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:56:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148672648] [2025-03-03 17:56:29,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 17:56:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:56:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:56:29,412 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:56:29,413 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:56:29,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-03 17:56:29,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 17:56:29,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-03 17:56:29,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:56:29,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 17:56:29,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:56:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:56:30,132 INFO L312 TraceCheckSpWp]: Computing backward predicates...