./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:08:31,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:08:31,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:08:31,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:08:31,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:08:31,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:08:31,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:08:31,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:08:31,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:08:31,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:08:31,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:08:31,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:08:31,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:08:31,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:08:31,818 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:08:31,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:08:31,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:08:31,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:08:31,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:08:31,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:31,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:08:31,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:31,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:08:31,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:08:31,822 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-jdk21/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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-01-09 07:08:32,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:08:32,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:08:32,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:08:32,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:08:32,156 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:08:32,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-01-09 07:08:33,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c960ffe21/e54e4b77945f48869ca3e22be37af291/FLAGdaeab7846 [2025-01-09 07:08:33,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:08:33,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-01-09 07:08:33,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c960ffe21/e54e4b77945f48869ca3e22be37af291/FLAGdaeab7846 [2025-01-09 07:08:33,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c960ffe21/e54e4b77945f48869ca3e22be37af291 [2025-01-09 07:08:33,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:08:33,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:08:33,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:08:33,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:08:33,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:08:33,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:08:33" (1/1) ... [2025-01-09 07:08:33,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecf3d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:33, skipping insertion in model container [2025-01-09 07:08:33,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:08:33" (1/1) ... [2025-01-09 07:08:33,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:08:34,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-01-09 07:08:34,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:08:34,174 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:08:34,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-01-09 07:08:34,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:08:34,250 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:08:34,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34 WrapperNode [2025-01-09 07:08:34,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:08:34,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:08:34,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:08:34,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:08:34,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,339 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 265 [2025-01-09 07:08:34,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:08:34,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:08:34,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:08:34,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:08:34,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,375 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-01-09 07:08:34,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:08:34,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:08:34,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:08:34,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:08:34,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (1/1) ... [2025-01-09 07:08:34,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:08:34,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:08:34,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:08:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:08:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:08:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:08:34,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:08:34,598 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:08:34,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:08:35,217 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-01-09 07:08:35,218 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:08:35,232 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:08:35,233 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:08:35,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:08:35 BoogieIcfgContainer [2025-01-09 07:08:35,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:08:35,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:08:35,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:08:35,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:08:35,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:08:33" (1/3) ... [2025-01-09 07:08:35,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6681350b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:08:35, skipping insertion in model container [2025-01-09 07:08:35,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:34" (2/3) ... [2025-01-09 07:08:35,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6681350b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:08:35, skipping insertion in model container [2025-01-09 07:08:35,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:08:35" (3/3) ... [2025-01-09 07:08:35,245 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-01-09 07:08:35,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:08:35,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:08:35,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:08:35,347 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;@7aa339af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:08:35,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:08:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 07:08:35,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:35,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:35,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:35,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2025-01-09 07:08:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150684571] [2025-01-09 07:08:35,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 07:08:35,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 07:08:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150684571] [2025-01-09 07:08:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150684571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:08:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296022659] [2025-01-09 07:08:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:35,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:08:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:35,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:08:35,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:08:35,913 INFO L87 Difference]: Start difference. First operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-01-09 07:08:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:35,975 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2025-01-09 07:08:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:08:35,979 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-01-09 07:08:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:35,986 INFO L225 Difference]: With dead ends: 133 [2025-01-09 07:08:35,987 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 07:08:35,993 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-01-09 07:08:35,996 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:36,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:08:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 07:08:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 07:08:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2025-01-09 07:08:36,044 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 13 [2025-01-09 07:08:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2025-01-09 07:08:36,045 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-01-09 07:08:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2025-01-09 07:08:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 07:08:36,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:36,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:36,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:08:36,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2025-01-09 07:08:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397503934] [2025-01-09 07:08:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:36,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 07:08:36,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 07:08:36,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:36,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397503934] [2025-01-09 07:08:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397503934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:36,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:08:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135188900] [2025-01-09 07:08:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:08:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:36,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:08:36,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:08:36,219 INFO L87 Difference]: Start difference. First operand 71 states and 101 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-01-09 07:08:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:36,263 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2025-01-09 07:08:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:08:36,264 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-01-09 07:08:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:36,265 INFO L225 Difference]: With dead ends: 134 [2025-01-09 07:08:36,265 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 07:08:36,266 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-01-09 07:08:36,266 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:36,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:08:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 07:08:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 07:08:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2025-01-09 07:08:36,277 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 14 [2025-01-09 07:08:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:36,277 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2025-01-09 07:08:36,277 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-01-09 07:08:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2025-01-09 07:08:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 07:08:36,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:36,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:36,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:08:36,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2025-01-09 07:08:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:36,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627112117] [2025-01-09 07:08:36,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:36,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 07:08:36,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 07:08:36,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:36,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:36,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627112117] [2025-01-09 07:08:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627112117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:08:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772280051] [2025-01-09 07:08:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:36,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:08:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:08:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:08:36,700 INFO L87 Difference]: Start difference. First operand 73 states and 103 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-01-09 07:08:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:36,859 INFO L93 Difference]: Finished difference Result 185 states and 262 transitions. [2025-01-09 07:08:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:08:36,860 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-01-09 07:08:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:36,863 INFO L225 Difference]: With dead ends: 185 [2025-01-09 07:08:36,865 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 07:08:36,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:36,867 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:36,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 420 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 07:08:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2025-01-09 07:08:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 0 states have call successors, (0), 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-01-09 07:08:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2025-01-09 07:08:36,880 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 15 [2025-01-09 07:08:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2025-01-09 07:08:36,881 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-01-09 07:08:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2025-01-09 07:08:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 07:08:36,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:36,886 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, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:08:36,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash 668881346, now seen corresponding path program 1 times [2025-01-09 07:08:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896093645] [2025-01-09 07:08:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:36,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 07:08:37,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 07:08:37,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:37,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896093645] [2025-01-09 07:08:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896093645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 07:08:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155969114] [2025-01-09 07:08:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 07:08:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:37,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 07:08:37,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 07:08:37,544 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 07:08:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:37,566 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2025-01-09 07:08:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 07:08:37,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 07:08:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:37,568 INFO L225 Difference]: With dead ends: 138 [2025-01-09 07:08:37,568 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 07:08:37,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 07:08:37,571 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:37,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:08:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 07:08:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 07:08:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 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-01-09 07:08:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2025-01-09 07:08:37,583 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 46 [2025-01-09 07:08:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:37,583 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2025-01-09 07:08:37,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-01-09 07:08:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2025-01-09 07:08:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 07:08:37,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:37,584 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:37,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:08:37,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1964229841, now seen corresponding path program 1 times [2025-01-09 07:08:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782086174] [2025-01-09 07:08:37,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:37,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 07:08:37,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 07:08:37,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:37,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782086174] [2025-01-09 07:08:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782086174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:37,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:08:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794273678] [2025-01-09 07:08:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:08:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:37,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:08:37,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:08:37,914 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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-01-09 07:08:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:38,096 INFO L93 Difference]: Finished difference Result 193 states and 270 transitions. [2025-01-09 07:08:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:08:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-01-09 07:08:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:38,099 INFO L225 Difference]: With dead ends: 193 [2025-01-09 07:08:38,099 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 07:08:38,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 07:08:38,101 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 59 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:38,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 583 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 07:08:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-01-09 07:08:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 0 states have call successors, (0), 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-01-09 07:08:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2025-01-09 07:08:38,114 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 47 [2025-01-09 07:08:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:38,114 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2025-01-09 07:08:38,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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-01-09 07:08:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2025-01-09 07:08:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:08:38,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:38,119 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:38,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:08:38,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -560587831, now seen corresponding path program 1 times [2025-01-09 07:08:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513059576] [2025-01-09 07:08:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:08:38,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:08:38,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513059576] [2025-01-09 07:08:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513059576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:08:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475466277] [2025-01-09 07:08:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:38,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:08:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:38,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:08:38,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:08:38,642 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-09 07:08:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:38,719 INFO L93 Difference]: Finished difference Result 189 states and 262 transitions. [2025-01-09 07:08:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:08:38,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:08:38,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:38,721 INFO L225 Difference]: With dead ends: 189 [2025-01-09 07:08:38,721 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 07:08:38,721 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-01-09 07:08:38,722 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:38,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 326 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 07:08:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2025-01-09 07:08:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2025-01-09 07:08:38,729 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 48 [2025-01-09 07:08:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:38,729 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2025-01-09 07:08:38,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-09 07:08:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2025-01-09 07:08:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 07:08:38,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:38,730 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:38,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:08:38,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:38,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash -601951643, now seen corresponding path program 1 times [2025-01-09 07:08:38,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:38,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666451867] [2025-01-09 07:08:38,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:38,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 07:08:38,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 07:08:38,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:38,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:39,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666451867] [2025-01-09 07:08:39,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666451867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:08:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498237381] [2025-01-09 07:08:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:39,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:08:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:39,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:08:39,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:39,286 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-09 07:08:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:39,415 INFO L93 Difference]: Finished difference Result 288 states and 398 transitions. [2025-01-09 07:08:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:08:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 07:08:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:39,417 INFO L225 Difference]: With dead ends: 288 [2025-01-09 07:08:39,417 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 07:08:39,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:08:39,418 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:39,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 733 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 07:08:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 152. [2025-01-09 07:08:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 151 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 07:08:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2025-01-09 07:08:39,436 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 48 [2025-01-09 07:08:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2025-01-09 07:08:39,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 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-01-09 07:08:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2025-01-09 07:08:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 07:08:39,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:39,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:39,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:08:39,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:39,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1286858396, now seen corresponding path program 1 times [2025-01-09 07:08:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:39,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949162963] [2025-01-09 07:08:39,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:39,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 07:08:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 07:08:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949162963] [2025-01-09 07:08:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949162963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:08:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044595878] [2025-01-09 07:08:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:08:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:39,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:08:39,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:08:39,724 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-01-09 07:08:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:39,766 INFO L93 Difference]: Finished difference Result 277 states and 382 transitions. [2025-01-09 07:08:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:08:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-01-09 07:08:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:39,770 INFO L225 Difference]: With dead ends: 277 [2025-01-09 07:08:39,771 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 07:08:39,771 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-01-09 07:08:39,772 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:39,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:08:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 07:08:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 07:08:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 151 states have internal predecessors, (207), 0 states have call successors, (0), 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-01-09 07:08:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2025-01-09 07:08:39,780 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 49 [2025-01-09 07:08:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:39,780 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2025-01-09 07:08:39,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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-01-09 07:08:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2025-01-09 07:08:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 07:08:39,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:39,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 07:08:39,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:39,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1600250730, now seen corresponding path program 1 times [2025-01-09 07:08:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967853591] [2025-01-09 07:08:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:39,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 07:08:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 07:08:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967853591] [2025-01-09 07:08:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967853591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 07:08:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249822662] [2025-01-09 07:08:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:08:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:08:40,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:08:40,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:08:40,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 07:08:40,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 07:08:40,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:40,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:40,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 07:08:40,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:08:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:40,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:08:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249822662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:40,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 07:08:40,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-01-09 07:08:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182750458] [2025-01-09 07:08:40,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:08:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:40,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:08:40,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 07:08:40,840 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:41,110 INFO L93 Difference]: Finished difference Result 285 states and 390 transitions. [2025-01-09 07:08:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:08:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 07:08:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:41,111 INFO L225 Difference]: With dead ends: 285 [2025-01-09 07:08:41,111 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 07:08:41,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 07:08:41,112 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:41,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 205 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 07:08:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 07:08:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2025-01-09 07:08:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 07:08:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2025-01-09 07:08:41,125 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 50 [2025-01-09 07:08:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:41,125 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2025-01-09 07:08:41,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2025-01-09 07:08:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 07:08:41,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:41,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:41,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 07:08:41,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:08:41,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:41,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:41,331 INFO L85 PathProgramCache]: Analyzing trace with hash 749947663, now seen corresponding path program 1 times [2025-01-09 07:08:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069484304] [2025-01-09 07:08:41,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 07:08:41,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 07:08:41,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:41,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:41,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069484304] [2025-01-09 07:08:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069484304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:08:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383206199] [2025-01-09 07:08:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:08:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:08:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:08:41,922 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 07:08:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:42,091 INFO L93 Difference]: Finished difference Result 279 states and 376 transitions. [2025-01-09 07:08:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:08:42,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 07:08:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:42,094 INFO L225 Difference]: With dead ends: 279 [2025-01-09 07:08:42,094 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 07:08:42,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:08:42,094 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:42,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 419 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:08:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 07:08:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 172. [2025-01-09 07:08:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.345029239766082) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 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-01-09 07:08:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2025-01-09 07:08:42,107 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 51 [2025-01-09 07:08:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:42,107 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2025-01-09 07:08:42,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 07:08:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2025-01-09 07:08:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 07:08:42,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:42,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:42,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 07:08:42,109 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash -611613326, now seen corresponding path program 1 times [2025-01-09 07:08:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640603951] [2025-01-09 07:08:42,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:42,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 07:08:42,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 07:08:42,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:42,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640603951] [2025-01-09 07:08:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640603951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:43,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 07:08:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85612829] [2025-01-09 07:08:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:08:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:43,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:08:43,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:08:43,112 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 07:08:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:43,388 INFO L93 Difference]: Finished difference Result 315 states and 421 transitions. [2025-01-09 07:08:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:08:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 07:08:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:43,390 INFO L225 Difference]: With dead ends: 315 [2025-01-09 07:08:43,391 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 07:08:43,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 07:08:43,392 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:43,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 426 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:08:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 07:08:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2025-01-09 07:08:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 191 states have internal predecessors, (255), 0 states have call successors, (0), 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-01-09 07:08:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2025-01-09 07:08:43,397 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 51 [2025-01-09 07:08:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:43,398 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2025-01-09 07:08:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 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-01-09 07:08:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2025-01-09 07:08:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 07:08:43,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:43,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 07:08:43,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:43,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1979372487, now seen corresponding path program 1 times [2025-01-09 07:08:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550483215] [2025-01-09 07:08:43,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:43,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 07:08:43,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 07:08:43,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:43,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550483215] [2025-01-09 07:08:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550483215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:08:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131198577] [2025-01-09 07:08:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:08:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:44,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:08:44,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:44,011 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:44,162 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2025-01-09 07:08:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:08:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 07:08:44,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:44,164 INFO L225 Difference]: With dead ends: 302 [2025-01-09 07:08:44,164 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 07:08:44,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:44,165 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:44,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 370 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 07:08:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 190. [2025-01-09 07:08:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.3492063492063493) internal successors, (255), 189 states have internal predecessors, (255), 0 states have call successors, (0), 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-01-09 07:08:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2025-01-09 07:08:44,171 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 52 [2025-01-09 07:08:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2025-01-09 07:08:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2025-01-09 07:08:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 07:08:44,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:44,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:44,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 07:08:44,173 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:44,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -849822859, now seen corresponding path program 1 times [2025-01-09 07:08:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163794089] [2025-01-09 07:08:44,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:44,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 07:08:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 07:08:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163794089] [2025-01-09 07:08:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163794089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:08:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23246] [2025-01-09 07:08:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:08:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:08:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:08:44,690 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:44,768 INFO L93 Difference]: Finished difference Result 301 states and 404 transitions. [2025-01-09 07:08:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:08:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 07:08:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:44,770 INFO L225 Difference]: With dead ends: 301 [2025-01-09 07:08:44,770 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 07:08:44,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:08:44,771 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 50 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:44,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 495 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 07:08:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2025-01-09 07:08:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 205 states have internal predecessors, (273), 0 states have call successors, (0), 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-01-09 07:08:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 273 transitions. [2025-01-09 07:08:44,777 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 273 transitions. Word has length 52 [2025-01-09 07:08:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 273 transitions. [2025-01-09 07:08:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 273 transitions. [2025-01-09 07:08:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 07:08:44,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:44,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:44,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 07:08:44,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -934888619, now seen corresponding path program 1 times [2025-01-09 07:08:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:44,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326232022] [2025-01-09 07:08:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:44,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:44,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 07:08:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 07:08:44,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:44,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326232022] [2025-01-09 07:08:45,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326232022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:45,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:45,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:08:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680922395] [2025-01-09 07:08:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:45,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:08:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:45,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:08:45,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:45,242 INFO L87 Difference]: Start difference. First operand 206 states and 273 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:45,364 INFO L93 Difference]: Finished difference Result 365 states and 490 transitions. [2025-01-09 07:08:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 07:08:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 07:08:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:45,365 INFO L225 Difference]: With dead ends: 365 [2025-01-09 07:08:45,365 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 07:08:45,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:08:45,366 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 84 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:45,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 774 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 07:08:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 160. [2025-01-09 07:08:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 159 states have internal predecessors, (211), 0 states have call successors, (0), 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-01-09 07:08:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2025-01-09 07:08:45,375 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 52 [2025-01-09 07:08:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:45,376 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2025-01-09 07:08:45,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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-01-09 07:08:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2025-01-09 07:08:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 07:08:45,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:45,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:45,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 07:08:45,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 440598411, now seen corresponding path program 1 times [2025-01-09 07:08:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485368765] [2025-01-09 07:08:45,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:45,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 07:08:45,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 07:08:45,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:45,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485368765] [2025-01-09 07:08:45,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485368765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:45,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 07:08:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177899138] [2025-01-09 07:08:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:45,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 07:08:45,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:45,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 07:08:45,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 07:08:45,986 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:46,227 INFO L93 Difference]: Finished difference Result 231 states and 307 transitions. [2025-01-09 07:08:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 07:08:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 07:08:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:46,228 INFO L225 Difference]: With dead ends: 231 [2025-01-09 07:08:46,228 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 07:08:46,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:08:46,229 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:46,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:08:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 07:08:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 07:08:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.320754716981132) internal successors, (210), 159 states have internal predecessors, (210), 0 states have call successors, (0), 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-01-09 07:08:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2025-01-09 07:08:46,236 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 53 [2025-01-09 07:08:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:46,241 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2025-01-09 07:08:46,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2025-01-09 07:08:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 07:08:46,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:46,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 07:08:46,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash -825456157, now seen corresponding path program 1 times [2025-01-09 07:08:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565239923] [2025-01-09 07:08:46,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:46,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 07:08:46,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 07:08:46,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:46,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565239923] [2025-01-09 07:08:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565239923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:46,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:08:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573884513] [2025-01-09 07:08:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:46,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:08:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:08:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:08:46,439 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:46,511 INFO L93 Difference]: Finished difference Result 245 states and 324 transitions. [2025-01-09 07:08:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:08:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 07:08:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:46,514 INFO L225 Difference]: With dead ends: 245 [2025-01-09 07:08:46,514 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 07:08:46,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-09 07:08:46,515 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 90 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:46,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 206 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 07:08:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-01-09 07:08:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.312883435582822) internal successors, (214), 163 states have internal predecessors, (214), 0 states have call successors, (0), 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-01-09 07:08:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 214 transitions. [2025-01-09 07:08:46,527 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 214 transitions. Word has length 53 [2025-01-09 07:08:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:46,527 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 214 transitions. [2025-01-09 07:08:46,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:08:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2025-01-09 07:08:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 07:08:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:46,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 07:08:46,532 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:46,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2016640248, now seen corresponding path program 1 times [2025-01-09 07:08:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179463793] [2025-01-09 07:08:46,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 07:08:46,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 07:08:46,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:46,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179463793] [2025-01-09 07:08:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179463793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 07:08:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350734012] [2025-01-09 07:08:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 07:08:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:47,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 07:08:47,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:08:47,408 INFO L87 Difference]: Start difference. First operand 164 states and 214 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 07:08:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:47,737 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2025-01-09 07:08:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 07:08:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 07:08:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:47,739 INFO L225 Difference]: With dead ends: 319 [2025-01-09 07:08:47,739 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 07:08:47,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 07:08:47,740 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 182 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:47,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 728 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 07:08:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 07:08:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-01-09 07:08:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.309090909090909) internal successors, (216), 165 states have internal predecessors, (216), 0 states have call successors, (0), 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-01-09 07:08:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2025-01-09 07:08:47,749 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 54 [2025-01-09 07:08:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:47,750 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2025-01-09 07:08:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 07:08:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2025-01-09 07:08:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 07:08:47,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:47,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:47,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 07:08:47,751 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2082331348, now seen corresponding path program 1 times [2025-01-09 07:08:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:47,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152614436] [2025-01-09 07:08:47,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:47,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 07:08:47,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 07:08:47,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:47,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152614436] [2025-01-09 07:08:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152614436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 07:08:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717161650] [2025-01-09 07:08:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:48,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 07:08:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:48,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 07:08:48,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 07:08:48,139 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-09 07:08:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:48,316 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2025-01-09 07:08:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 07:08:48,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 07:08:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:48,318 INFO L225 Difference]: With dead ends: 272 [2025-01-09 07:08:48,318 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 07:08:48,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 07:08:48,319 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:48,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 522 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:08:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 07:08:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 07:08:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 0 states have call successors, (0), 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-01-09 07:08:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2025-01-09 07:08:48,325 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 55 [2025-01-09 07:08:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:48,325 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2025-01-09 07:08:48,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-09 07:08:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2025-01-09 07:08:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 07:08:48,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:48,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:48,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 07:08:48,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1046448359, now seen corresponding path program 1 times [2025-01-09 07:08:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227828962] [2025-01-09 07:08:48,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:48,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 07:08:48,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 07:08:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:08:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227828962] [2025-01-09 07:08:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227828962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:48,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:48,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:08:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736887385] [2025-01-09 07:08:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:48,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:08:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:08:48,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:08:48,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:08:48,501 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-09 07:08:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:48,554 INFO L93 Difference]: Finished difference Result 272 states and 352 transitions. [2025-01-09 07:08:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:08:48,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 07:08:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:48,555 INFO L225 Difference]: With dead ends: 272 [2025-01-09 07:08:48,556 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 07:08:48,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:08:48,556 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:08:48,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:08:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 07:08:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-09 07:08:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 0 states have call successors, (0), 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-01-09 07:08:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-01-09 07:08:48,562 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 55 [2025-01-09 07:08:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-01-09 07:08:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-01-09 07:08:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-01-09 07:08:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 07:08:48,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:48,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 07:08:48,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 790817595, now seen corresponding path program 1 times [2025-01-09 07:08:48,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:08:48,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845584676] [2025-01-09 07:08:48,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:08:48,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 07:08:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 07:08:48,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:48,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:08:48,684 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:08:48,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 07:08:48,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 07:08:48,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:08:48,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:08:48,808 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:08:48,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:08:48,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 07:08:48,814 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:48,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:08:48,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:08:48 BoogieIcfgContainer [2025-01-09 07:08:48,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:08:48,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:08:48,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:08:48,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:08:48,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:08:35" (3/4) ... [2025-01-09 07:08:48,881 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:08:48,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:08:48,882 INFO L158 Benchmark]: Toolchain (without parser) took 14977.91ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 121.3MB in the beginning and 322.4MB in the end (delta: -201.1MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,883 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:08:48,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.35ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 106.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.56ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 100.8MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:08:48,884 INFO L158 Benchmark]: Boogie Preprocessor took 94.69ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 96.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,884 INFO L158 Benchmark]: RCFGBuilder took 797.52ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 61.0MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,884 INFO L158 Benchmark]: TraceAbstraction took 13641.33ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 60.2MB in the beginning and 322.5MB in the end (delta: -262.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,886 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 486.5MB. Free memory was 322.5MB in the beginning and 322.4MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:08:48,887 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.28ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.35ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 106.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.56ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 100.8MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 94.69ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 96.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 797.52ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 61.0MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13641.33ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 60.2MB in the beginning and 322.5MB in the end (delta: -262.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 486.5MB. Free memory was 322.5MB in the beginning and 322.4MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 78, overapproximation of bitwiseOr at line 134, overapproximation of bitwiseAnd at line 135, overapproximation of bitwiseAnd at line 147, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_1 var_14 = 1; [L34] const SORT_4 var_19 = 1; [L35] const SORT_4 var_22 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L41] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 init_7_arg_1 = var_5; [L44] state_6 = init_7_arg_1 [L45] SORT_4 init_9_arg_1 = var_5; [L46] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L65] RET __VERIFIER_assert(!(bad_17_arg_0)) [L67] SORT_1 var_31_arg_0 = input_3; [L68] SORT_1 var_31 = ~var_31_arg_0; [L69] SORT_4 var_32_arg_0 = state_6; [L70] SORT_4 var_32_arg_1 = state_8; [L71] SORT_1 var_32 = var_32_arg_0 > var_32_arg_1; [L72] SORT_1 var_33_arg_0 = var_31; [L73] SORT_1 var_33_arg_1 = var_32; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33_arg_0=-256, var_33_arg_1=0] [L74] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L74] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L75] EXPR var_33 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L75] var_33 = var_33 & mask_SORT_1 [L76] SORT_4 var_28_arg_0 = var_22; [L77] SORT_4 var_28_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28_arg_0=15, var_28_arg_1=1, var_33=0] [L78] EXPR var_28_arg_0 >> var_28_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33=0] [L78] SORT_4 var_28 = var_28_arg_0 >> var_28_arg_1; [L79] SORT_4 var_29_arg_0 = state_6; [L80] SORT_4 var_29_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_29_arg_0=0, var_29_arg_1=1, var_33=0] [L81] EXPR var_29_arg_0 >> var_29_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_33=0] [L81] SORT_4 var_29 = var_29_arg_0 >> var_29_arg_1; [L82] SORT_4 var_30_arg_0 = var_28; [L83] SORT_4 var_30_arg_1 = var_29; [L84] SORT_4 var_30 = var_30_arg_0 + var_30_arg_1; [L85] SORT_4 var_26_arg_0 = state_6; [L86] SORT_4 var_26_arg_1 = state_8; [L87] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L88] SORT_4 var_21_arg_0 = state_8; [L89] SORT_4 var_21_arg_1 = state_6; [L90] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L91] SORT_4 var_23_arg_0 = state_6; [L92] SORT_4 var_23_arg_1 = var_22; [L93] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L94] SORT_1 var_24_arg_0 = var_21; [L95] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_24_arg_0=1, var_24_arg_1=1, var_26=0, var_30=1, var_33=0] [L96] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L96] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L97] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L97] var_24 = var_24 & mask_SORT_1 [L98] SORT_4 var_20_arg_0 = state_6; [L99] SORT_4 var_20_arg_1 = var_19; [L100] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L101] SORT_1 var_25_arg_0 = var_24; [L102] SORT_4 var_25_arg_1 = var_20; [L103] SORT_4 var_25_arg_2 = state_8; [L104] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L105] SORT_1 var_27_arg_0 = var_26; [L106] SORT_4 var_27_arg_1 = state_6; [L107] SORT_4 var_27_arg_2 = var_25; [L108] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_4 var_34_arg_1 = var_30; [L111] SORT_4 var_34_arg_2 = var_27; [L112] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_34=1] [L113] EXPR var_34 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L113] var_34 = var_34 & mask_SORT_4 [L114] SORT_4 next_35_arg_1 = var_34; [L115] SORT_1 var_42_arg_0 = input_3; [L116] SORT_1 var_42 = ~var_42_arg_0; [L117] SORT_4 var_43_arg_0 = state_6; [L118] SORT_4 var_43_arg_1 = state_8; [L119] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L120] SORT_1 var_44_arg_0 = var_42; [L121] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44_arg_0=-256, var_44_arg_1=0] [L122] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L122] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L123] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L123] var_44 = var_44 & mask_SORT_1 [L124] SORT_4 var_37_arg_0 = state_6; [L125] SORT_4 var_37_arg_1 = state_8; [L126] SORT_1 var_37 = var_37_arg_0 > var_37_arg_1; [L127] SORT_1 var_38_arg_0 = var_37; [L128] SORT_1 var_38 = ~var_38_arg_0; [L129] SORT_4 var_39_arg_0 = state_6; [L130] SORT_4 var_39_arg_1 = var_22; [L131] SORT_1 var_39 = var_39_arg_0 != var_39_arg_1; [L132] SORT_1 var_40_arg_0 = var_38; [L133] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_40_arg_0=-1, var_40_arg_1=1, var_44=0] [L134] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L134] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L135] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L135] var_40 = var_40 & mask_SORT_1 [L136] SORT_4 var_36_arg_0 = state_8; [L137] SORT_4 var_36_arg_1 = var_19; [L138] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L139] SORT_1 var_41_arg_0 = var_40; [L140] SORT_4 var_41_arg_1 = var_36; [L141] SORT_4 var_41_arg_2 = state_6; [L142] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L143] SORT_1 var_45_arg_0 = var_44; [L144] SORT_4 var_45_arg_1 = state_8; [L145] SORT_4 var_45_arg_2 = var_41; [L146] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15, var_45=1] [L147] EXPR var_45 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15] [L147] var_45 = var_45 & mask_SORT_4 [L148] SORT_4 next_46_arg_1 = var_45; [L150] state_6 = next_35_arg_1 [L151] state_8 = next_46_arg_1 [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1152 mSDsluCounter, 7818 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6065 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2122 IncrementalHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1753 mSDtfsCounter, 2122 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=13, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 320 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 888 ConstructedInterpolants, 0 QuantifiedInterpolants, 4181 SizeOfPredicates, 1 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 98/102 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-01-09 07:08:48,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:08:51,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:08:51,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:08:51,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:08:51,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:08:51,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:08:51,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:08:51,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:08:51,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:08:51,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:08:51,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:08:51,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:08:51,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:08:51,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:08:51,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:08:51,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:08:51,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:51,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:51,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:08:51,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:08:51,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:08:51,494 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-jdk21/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 -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-01-09 07:08:51,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:08:51,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:08:51,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:08:51,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:08:51,818 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:08:51,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-01-09 07:08:53,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6d4c62a/2c6240dd2e9c4f349baea5e3402cfb93/FLAG40618f3da [2025-01-09 07:08:53,531 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:08:53,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-01-09 07:08:53,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6d4c62a/2c6240dd2e9c4f349baea5e3402cfb93/FLAG40618f3da [2025-01-09 07:08:53,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b6d4c62a/2c6240dd2e9c4f349baea5e3402cfb93 [2025-01-09 07:08:53,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:08:53,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:08:53,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:08:53,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:08:53,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:08:53,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7172f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53, skipping insertion in model container [2025-01-09 07:08:53,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:08:53,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-01-09 07:08:53,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:08:53,833 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:08:53,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-01-09 07:08:53,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:08:53,893 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:08:53,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53 WrapperNode [2025-01-09 07:08:53,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:08:53,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:08:53,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:08:53,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:08:53,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,956 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-01-09 07:08:53,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:08:53,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:08:53,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:08:53,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:08:53,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:53,996 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-01-09 07:08:54,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,009 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:08:54,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:08:54,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:08:54,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:08:54,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (1/1) ... [2025-01-09 07:08:54,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:08:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:08:54,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:08:54,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:08:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:08:54,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:08:54,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:08:54,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:08:54,199 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:08:54,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:08:54,408 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 07:08:54,408 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:08:54,414 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:08:54,415 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:08:54,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:08:54 BoogieIcfgContainer [2025-01-09 07:08:54,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:08:54,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:08:54,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:08:54,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:08:54,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:08:53" (1/3) ... [2025-01-09 07:08:54,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63149e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:08:54, skipping insertion in model container [2025-01-09 07:08:54,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:08:53" (2/3) ... [2025-01-09 07:08:54,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63149e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:08:54, skipping insertion in model container [2025-01-09 07:08:54,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:08:54" (3/3) ... [2025-01-09 07:08:54,426 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-01-09 07:08:54,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:08:54,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:08:54,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:08:54,511 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;@680368f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:08:54,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:08:54,518 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-01-09 07:08:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:08:54,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:54,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:08:54,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:54,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:08:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:08:54,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951768334] [2025-01-09 07:08:54,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:54,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:08:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:08:54,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:08:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:08:54,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:08:54,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:08:54,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:54,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:54,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 07:08:54,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:08:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:54,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:08:54,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:08:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951768334] [2025-01-09 07:08:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951768334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:08:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:08:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:08:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926971310] [2025-01-09 07:08:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:08:54,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:08:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:08:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:08:54,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:08:54,918 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-01-09 07:08:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:08:54,966 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 07:08:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:08:54,969 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-01-09 07:08:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:08:54,976 INFO L225 Difference]: With dead ends: 18 [2025-01-09 07:08:54,976 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 07:08:54,979 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-01-09 07:08:54,983 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-01-09 07:08:54,983 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-01-09 07:08:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 07:08:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 07:08:55,009 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-01-09 07:08:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:08:55,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:08:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:08:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:08:55,016 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-01-09 07:08:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:08:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:08:55,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:08:55,018 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:08:55,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:08:55,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:08:55,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:08:55,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:08:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:08:55,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:08:55,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443072098] [2025-01-09 07:08:55,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:08:55,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:08:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:08:55,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:08:55,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:08:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:08:55,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:08:55,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:08:55,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:08:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 07:08:55,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:08:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:55,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:08:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:08:59,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:08:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443072098] [2025-01-09 07:08:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443072098] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 07:08:59,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 07:08:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 07:08:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634492559] [2025-01-09 07:08:59,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 07:08:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 07:08:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:08:59,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 07:08:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 07:08:59,456 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-01-09 07:09:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:09:00,036 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-01-09 07:09:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 07:09:00,037 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-01-09 07:09:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:09:00,038 INFO L225 Difference]: With dead ends: 21 [2025-01-09 07:09:00,038 INFO L226 Difference]: Without dead ends: 19 [2025-01-09 07:09:00,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-09 07:09:00,039 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 07:09:00,039 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.2s Time] [2025-01-09 07:09:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-09 07:09:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-01-09 07:09:00,045 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-01-09 07:09:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-01-09 07:09:00,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-01-09 07:09:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:09:00,047 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-01-09 07:09:00,047 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-01-09 07:09:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-01-09 07:09:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 07:09:00,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:09:00,048 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-01-09 07:09:00,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 07:09:00,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:09:00,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:09:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:09:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 2 times [2025-01-09 07:09:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:09:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023098583] [2025-01-09 07:09:00,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 07:09:00,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:09:00,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:09:00,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:09:00,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 07:09:00,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 07:09:00,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 07:09:00,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 07:09:00,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:09:00,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 07:09:00,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:09:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:09:00,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 07:09:29,580 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 1437 DAG size of output: 1271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)