./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:24:37,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:24:38,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:24:38,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:24:38,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:24:38,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:24:38,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:24:38,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:24:38,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:24:38,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:24:38,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:24:38,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:24:38,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:24:38,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:24:38,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:24:38,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:24:38,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:24:38,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:38,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:24:38,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:24:38,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:24:38,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:24:38,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 [2025-03-08 15:24:38,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:24:38,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:24:38,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:24:38,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:24:38,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:24:38,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2025-03-08 15:24:39,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d05875/42ea02982708453facb2d1c8e18fd0eb/FLAG5243fcb24 [2025-03-08 15:24:39,865 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:24:39,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2025-03-08 15:24:39,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d05875/42ea02982708453facb2d1c8e18fd0eb/FLAG5243fcb24 [2025-03-08 15:24:39,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d05875/42ea02982708453facb2d1c8e18fd0eb [2025-03-08 15:24:39,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:24:39,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:24:39,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:39,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:24:39,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:24:39,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:39" (1/1) ... [2025-03-08 15:24:39,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f39d194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:39, skipping insertion in model container [2025-03-08 15:24:39,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:39" (1/1) ... [2025-03-08 15:24:39,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:24:40,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i[916,929] [2025-03-08 15:24:40,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:40,213 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:24:40,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i[916,929] [2025-03-08 15:24:40,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:40,293 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:24:40,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40 WrapperNode [2025-03-08 15:24:40,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:40,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:40,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:24:40,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:24:40,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,383 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-03-08 15:24:40,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:40,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:24:40,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:24:40,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:24:40,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,444 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:24:40,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:24:40,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:24:40,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:24:40,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:24:40,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (1/1) ... [2025-03-08 15:24:40,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:40,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:40,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:24:40,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:24:40,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:24:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:24:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:24:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:24:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:24:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:24:40,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:24:40,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:24:41,266 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc property_#t~bitwise41#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-08 15:24:41,345 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 15:24:41,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:24:41,365 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:24:41,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:24:41,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:41 BoogieIcfgContainer [2025-03-08 15:24:41,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:24:41,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:24:41,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:24:41,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:24:41,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:24:39" (1/3) ... [2025-03-08 15:24:41,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431773e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:41, skipping insertion in model container [2025-03-08 15:24:41,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:40" (2/3) ... [2025-03-08 15:24:41,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431773e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:41, skipping insertion in model container [2025-03-08 15:24:41,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:41" (3/3) ... [2025-03-08 15:24:41,374 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-62.i [2025-03-08 15:24:41,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:24:41,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-62.i that has 2 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:24:41,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:24:41,441 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;@239d9340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:24:41,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:24:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:24:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 15:24:41,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:41,458 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:41,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:41,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:41,463 INFO L85 PathProgramCache]: Analyzing trace with hash 162657793, now seen corresponding path program 1 times [2025-03-08 15:24:41,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389859664] [2025-03-08 15:24:41,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:41,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 15:24:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 15:24:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:41,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-08 15:24:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389859664] [2025-03-08 15:24:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389859664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534337961] [2025-03-08 15:24:41,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:41,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:41,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:41,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:41,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:24:42,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 15:24:42,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 15:24:42,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:42,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:42,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:24:42,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-03-08 15:24:42,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:24:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534337961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:42,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:24:42,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:24:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441054819] [2025-03-08 15:24:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:42,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:24:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:24:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:42,292 INFO L87 Difference]: Start difference. First operand has 186 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 128 states have internal predecessors, (186), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:24:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:42,324 INFO L93 Difference]: Finished difference Result 364 states and 645 transitions. [2025-03-08 15:24:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:24:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 369 [2025-03-08 15:24:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:42,332 INFO L225 Difference]: With dead ends: 364 [2025-03-08 15:24:42,332 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 15:24:42,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:42,338 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:42,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 15:24:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 15:24:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:24:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2025-03-08 15:24:42,382 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 369 [2025-03-08 15:24:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2025-03-08 15:24:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-08 15:24:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2025-03-08 15:24:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 15:24:42,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:42,391 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:42,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:24:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:24:42,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash -320275617, now seen corresponding path program 1 times [2025-03-08 15:24:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457996640] [2025-03-08 15:24:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:42,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 15:24:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 15:24:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457996640] [2025-03-08 15:24:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457996640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104187483] [2025-03-08 15:24:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:43,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:43,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:43,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:43,028 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:43,133 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2025-03-08 15:24:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2025-03-08 15:24:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:43,141 INFO L225 Difference]: With dead ends: 520 [2025-03-08 15:24:43,142 INFO L226 Difference]: Without dead ends: 342 [2025-03-08 15:24:43,144 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-03-08 15:24:43,145 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 254 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:43,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 774 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-08 15:24:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2025-03-08 15:24:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:24:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2025-03-08 15:24:43,181 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 369 [2025-03-08 15:24:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:43,184 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2025-03-08 15:24:43,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2025-03-08 15:24:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 15:24:43,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:43,191 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:43,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:24:43,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:43,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1087188477, now seen corresponding path program 1 times [2025-03-08 15:24:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761895544] [2025-03-08 15:24:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 15:24:43,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 15:24:43,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:43,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761895544] [2025-03-08 15:24:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761895544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972864968] [2025-03-08 15:24:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:43,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:43,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:43,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:43,877 INFO L87 Difference]: Start difference. First operand 199 states and 319 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:43,954 INFO L93 Difference]: Finished difference Result 591 states and 951 transitions. [2025-03-08 15:24:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-03-08 15:24:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:43,957 INFO L225 Difference]: With dead ends: 591 [2025-03-08 15:24:43,958 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 15:24:43,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:43,961 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 163 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:43,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 962 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 15:24:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2025-03-08 15:24:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 278 states have (on average 1.4712230215827338) internal successors, (409), 278 states have internal predecessors, (409), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 15:24:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 633 transitions. [2025-03-08 15:24:44,014 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 633 transitions. Word has length 370 [2025-03-08 15:24:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:44,016 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 633 transitions. [2025-03-08 15:24:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 633 transitions. [2025-03-08 15:24:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 15:24:44,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:44,020 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:24:44,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -545615522, now seen corresponding path program 1 times [2025-03-08 15:24:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675580176] [2025-03-08 15:24:44,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 15:24:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 15:24:44,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:44,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:44,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675580176] [2025-03-08 15:24:44,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675580176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:44,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:44,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107486274] [2025-03-08 15:24:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:44,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:44,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:44,345 INFO L87 Difference]: Start difference. First operand 393 states and 633 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:44,379 INFO L93 Difference]: Finished difference Result 395 states and 634 transitions. [2025-03-08 15:24:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:44,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2025-03-08 15:24:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:44,382 INFO L225 Difference]: With dead ends: 395 [2025-03-08 15:24:44,382 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 15:24:44,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:44,383 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:44,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 839 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 15:24:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 15:24:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 15:24:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2025-03-08 15:24:44,395 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 370 [2025-03-08 15:24:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:44,395 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2025-03-08 15:24:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2025-03-08 15:24:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-08 15:24:44,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:44,399 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:44,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:24:44,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash -201725444, now seen corresponding path program 1 times [2025-03-08 15:24:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739360784] [2025-03-08 15:24:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:44,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-08 15:24:44,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-08 15:24:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739360784] [2025-03-08 15:24:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739360784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336537851] [2025-03-08 15:24:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:45,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:45,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:45,130 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:45,508 INFO L93 Difference]: Finished difference Result 592 states and 946 transitions. [2025-03-08 15:24:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 371 [2025-03-08 15:24:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:45,512 INFO L225 Difference]: With dead ends: 592 [2025-03-08 15:24:45,513 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 15:24:45,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:24:45,514 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 174 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:45,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 980 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:24:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 15:24:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 308. [2025-03-08 15:24:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 15:24:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 489 transitions. [2025-03-08 15:24:45,560 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 489 transitions. Word has length 371 [2025-03-08 15:24:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:45,561 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 489 transitions. [2025-03-08 15:24:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 489 transitions. [2025-03-08 15:24:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 15:24:45,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:45,565 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:24:45,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1510698360, now seen corresponding path program 1 times [2025-03-08 15:24:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851083485] [2025-03-08 15:24:45,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:45,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 15:24:45,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 15:24:45,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:46,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:46,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851083485] [2025-03-08 15:24:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851083485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:46,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506125327] [2025-03-08 15:24:46,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:46,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:46,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:46,096 INFO L87 Difference]: Start difference. First operand 308 states and 489 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:46,212 INFO L93 Difference]: Finished difference Result 504 states and 803 transitions. [2025-03-08 15:24:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-03-08 15:24:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:46,217 INFO L225 Difference]: With dead ends: 504 [2025-03-08 15:24:46,218 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 15:24:46,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:46,219 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 161 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 529 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 15:24:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-08 15:24:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 193 states have internal predecessors, (264), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 15:24:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 488 transitions. [2025-03-08 15:24:46,247 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 488 transitions. Word has length 372 [2025-03-08 15:24:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:46,248 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 488 transitions. [2025-03-08 15:24:46,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 488 transitions. [2025-03-08 15:24:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 15:24:46,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:46,251 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:46,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:24:46,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:46,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -746212647, now seen corresponding path program 1 times [2025-03-08 15:24:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113788571] [2025-03-08 15:24:46,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 15:24:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 15:24:46,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:46,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:24:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113788571] [2025-03-08 15:24:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113788571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584254158] [2025-03-08 15:24:47,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:47,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:47,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:47,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:24:47,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 15:24:47,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 15:24:47,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:47,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:47,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 15:24:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4269 proven. 213 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2025-03-08 15:24:48,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 411 proven. 231 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2025-03-08 15:24:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584254158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:49,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 28 [2025-03-08 15:24:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059172975] [2025-03-08 15:24:49,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:49,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 15:24:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:49,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 15:24:49,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:24:49,771 INFO L87 Difference]: Start difference. First operand 308 states and 488 transitions. Second operand has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-03-08 15:24:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:51,565 INFO L93 Difference]: Finished difference Result 664 states and 1003 transitions. [2025-03-08 15:24:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 15:24:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) Word has length 372 [2025-03-08 15:24:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:51,570 INFO L225 Difference]: With dead ends: 664 [2025-03-08 15:24:51,571 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 15:24:51,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=894, Invalid=2412, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 15:24:51,574 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 811 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:51,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1351 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:24:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 15:24:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 445. [2025-03-08 15:24:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 313 states have (on average 1.3706070287539935) internal successors, (429), 314 states have internal predecessors, (429), 117 states have call successors, (117), 14 states have call predecessors, (117), 14 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 663 transitions. [2025-03-08 15:24:51,622 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 663 transitions. Word has length 372 [2025-03-08 15:24:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 663 transitions. [2025-03-08 15:24:51,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.142857142857142) internal successors, (256), 28 states have internal predecessors, (256), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (148), 9 states have call predecessors, (148), 9 states have call successors, (148) [2025-03-08 15:24:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 663 transitions. [2025-03-08 15:24:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:24:51,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:51,625 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:51,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:51,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 15:24:51,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:51,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:51,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1277871279, now seen corresponding path program 1 times [2025-03-08 15:24:51,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990498148] [2025-03-08 15:24:51,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:51,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:24:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:24:52,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:52,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:24:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990498148] [2025-03-08 15:24:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990498148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:24:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017024349] [2025-03-08 15:24:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:24:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:24:52,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:24:52,890 INFO L87 Difference]: Start difference. First operand 445 states and 663 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:53,460 INFO L93 Difference]: Finished difference Result 736 states and 1081 transitions. [2025-03-08 15:24:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:24:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-03-08 15:24:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:53,464 INFO L225 Difference]: With dead ends: 736 [2025-03-08 15:24:53,464 INFO L226 Difference]: Without dead ends: 427 [2025-03-08 15:24:53,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:24:53,466 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 276 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:53,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 758 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:24:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-08 15:24:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 411. [2025-03-08 15:24:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.296028880866426) internal successors, (359), 278 states have internal predecessors, (359), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 593 transitions. [2025-03-08 15:24:53,502 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 593 transitions. Word has length 374 [2025-03-08 15:24:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:53,502 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 593 transitions. [2025-03-08 15:24:53,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 1 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 2 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 593 transitions. [2025-03-08 15:24:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:24:53,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:53,504 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:53,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:24:53,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 259058335, now seen corresponding path program 1 times [2025-03-08 15:24:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583777577] [2025-03-08 15:24:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:53,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:24:53,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:24:53,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:53,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:53,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583777577] [2025-03-08 15:24:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583777577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008397338] [2025-03-08 15:24:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:53,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:53,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:53,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:53,633 INFO L87 Difference]: Start difference. First operand 411 states and 593 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:53,686 INFO L93 Difference]: Finished difference Result 682 states and 990 transitions. [2025-03-08 15:24:53,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:53,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-03-08 15:24:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:53,692 INFO L225 Difference]: With dead ends: 682 [2025-03-08 15:24:53,693 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 15:24:53,694 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-03-08 15:24:53,695 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:53,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 15:24:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-08 15:24:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 277 states have (on average 1.288808664259928) internal successors, (357), 278 states have internal predecessors, (357), 117 states have call successors, (117), 16 states have call predecessors, (117), 16 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 591 transitions. [2025-03-08 15:24:53,725 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 591 transitions. Word has length 374 [2025-03-08 15:24:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:53,725 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 591 transitions. [2025-03-08 15:24:53,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 591 transitions. [2025-03-08 15:24:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:24:53,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:53,727 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:53,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:24:53,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:53,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1548396128, now seen corresponding path program 1 times [2025-03-08 15:24:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251805610] [2025-03-08 15:24:53,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:53,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:24:54,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:24:54,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:54,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 369 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-03-08 15:24:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251805610] [2025-03-08 15:24:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251805610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432150171] [2025-03-08 15:24:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:55,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:55,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:24:55,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:24:55,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:24:55,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:55,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:55,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 15:24:55,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3151 proven. 252 refuted. 0 times theorem prover too weak. 2757 trivial. 0 not checked. [2025-03-08 15:24:56,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 72 proven. 255 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-08 15:24:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432150171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:57,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-03-08 15:24:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336241920] [2025-03-08 15:24:57,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 15:24:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 15:24:57,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:24:57,119 INFO L87 Difference]: Start difference. First operand 411 states and 591 transitions. Second operand has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-08 15:24:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:58,511 INFO L93 Difference]: Finished difference Result 787 states and 1103 transitions. [2025-03-08 15:24:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 15:24:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) Word has length 374 [2025-03-08 15:24:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:58,517 INFO L225 Difference]: With dead ends: 787 [2025-03-08 15:24:58,518 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 15:24:58,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=508, Invalid=1384, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 15:24:58,520 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1481 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:58,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1322 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:24:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 15:24:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 443. [2025-03-08 15:24:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 301 states have (on average 1.2591362126245846) internal successors, (379), 302 states have internal predecessors, (379), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 613 transitions. [2025-03-08 15:24:58,556 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 613 transitions. Word has length 374 [2025-03-08 15:24:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:58,557 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 613 transitions. [2025-03-08 15:24:58,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.692307692307692) internal successors, (226), 26 states have internal predecessors, (226), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-08 15:24:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 613 transitions. [2025-03-08 15:24:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-08 15:24:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:58,559 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:58,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:58,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:58,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:58,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1537080001, now seen corresponding path program 1 times [2025-03-08 15:24:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:58,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899181495] [2025-03-08 15:24:58,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:58,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:58,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-08 15:24:58,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-08 15:24:58,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:58,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899181495] [2025-03-08 15:24:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899181495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161196645] [2025-03-08 15:24:58,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:58,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:58,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:58,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:58,944 INFO L87 Difference]: Start difference. First operand 443 states and 613 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:59,192 INFO L93 Difference]: Finished difference Result 888 states and 1249 transitions. [2025-03-08 15:24:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:24:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2025-03-08 15:24:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:59,196 INFO L225 Difference]: With dead ends: 888 [2025-03-08 15:24:59,196 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 15:24:59,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:24:59,197 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 235 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:59,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1039 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:24:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 15:24:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 475. [2025-03-08 15:24:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 333 states have (on average 1.2852852852852852) internal successors, (428), 334 states have internal predecessors, (428), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 662 transitions. [2025-03-08 15:24:59,234 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 662 transitions. Word has length 374 [2025-03-08 15:24:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:59,234 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 662 transitions. [2025-03-08 15:24:59,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 662 transitions. [2025-03-08 15:24:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 15:24:59,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:59,237 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:59,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:24:59,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1535737592, now seen corresponding path program 1 times [2025-03-08 15:24:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676442991] [2025-03-08 15:24:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:59,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:24:59,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:24:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-08 15:24:59,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676442991] [2025-03-08 15:24:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676442991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395964570] [2025-03-08 15:24:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:59,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:59,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:59,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:59,328 INFO L87 Difference]: Start difference. First operand 475 states and 662 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:59,417 INFO L93 Difference]: Finished difference Result 1102 states and 1542 transitions. [2025-03-08 15:24:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2025-03-08 15:24:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:59,422 INFO L225 Difference]: With dead ends: 1102 [2025-03-08 15:24:59,422 INFO L226 Difference]: Without dead ends: 795 [2025-03-08 15:24:59,423 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-03-08 15:24:59,424 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 236 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:59,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 514 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-08 15:24:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 585. [2025-03-08 15:24:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 443 states have (on average 1.329571106094808) internal successors, (589), 444 states have internal predecessors, (589), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:24:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 823 transitions. [2025-03-08 15:24:59,483 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 823 transitions. Word has length 375 [2025-03-08 15:24:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:59,483 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 823 transitions. [2025-03-08 15:24:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-08 15:24:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 823 transitions. [2025-03-08 15:24:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 15:24:59,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:59,485 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:59,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:24:59,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:59,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1790474137, now seen corresponding path program 1 times [2025-03-08 15:24:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589344427] [2025-03-08 15:24:59,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:59,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:24:59,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:24:59,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:59,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:25:00,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589344427] [2025-03-08 15:25:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589344427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006896156] [2025-03-08 15:25:00,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:00,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:00,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:25:00,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:25:00,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:25:00,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:00,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:00,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:25:00,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1065 proven. 150 refuted. 0 times theorem prover too weak. 4945 trivial. 0 not checked. [2025-03-08 15:25:01,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:25:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:25:01,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006896156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:25:01,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:25:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-08 15:25:01,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720593949] [2025-03-08 15:25:01,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:25:01,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:25:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:01,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:25:01,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:25:01,548 INFO L87 Difference]: Start difference. First operand 585 states and 823 transitions. Second operand has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) [2025-03-08 15:25:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:02,189 INFO L93 Difference]: Finished difference Result 975 states and 1359 transitions. [2025-03-08 15:25:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:25:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) Word has length 375 [2025-03-08 15:25:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:02,196 INFO L225 Difference]: With dead ends: 975 [2025-03-08 15:25:02,196 INFO L226 Difference]: Without dead ends: 612 [2025-03-08 15:25:02,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 745 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:25:02,199 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 422 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:02,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 884 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:25:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-08 15:25:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 593. [2025-03-08 15:25:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 449 states have (on average 1.3207126948775056) internal successors, (593), 450 states have internal predecessors, (593), 117 states have call successors, (117), 26 states have call predecessors, (117), 26 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:25:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 827 transitions. [2025-03-08 15:25:02,265 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 827 transitions. Word has length 375 [2025-03-08 15:25:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:02,266 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 827 transitions. [2025-03-08 15:25:02,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.357142857142858) internal successors, (187), 14 states have internal predecessors, (187), 3 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 3 states have call predecessors, (157), 3 states have call successors, (157) [2025-03-08 15:25:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 827 transitions. [2025-03-08 15:25:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 15:25:02,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:02,268 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:02,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:25:02,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:02,470 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:02,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1759454330, now seen corresponding path program 1 times [2025-03-08 15:25:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24055974] [2025-03-08 15:25:02,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:25:02,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:25:02,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:25:02,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894519164] [2025-03-08 15:25:02,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:02,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:02,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:02,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:25:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:25:03,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:25:03,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:03,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:03,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 15:25:03,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:04,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3963 proven. 270 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2025-03-08 15:25:04,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:25:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24055974] [2025-03-08 15:25:04,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:25:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894519164] [2025-03-08 15:25:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894519164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:04,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-08 15:25:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086090572] [2025-03-08 15:25:04,459 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 15:25:04,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:25:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:04,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:25:04,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:25:04,460 INFO L87 Difference]: Start difference. First operand 593 states and 827 transitions. Second operand has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-08 15:25:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:05,160 INFO L93 Difference]: Finished difference Result 1695 states and 2372 transitions. [2025-03-08 15:25:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 15:25:05,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 375 [2025-03-08 15:25:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:05,171 INFO L225 Difference]: With dead ends: 1695 [2025-03-08 15:25:05,172 INFO L226 Difference]: Without dead ends: 1260 [2025-03-08 15:25:05,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:25:05,174 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 395 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:05,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1503 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:25:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-08 15:25:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1046. [2025-03-08 15:25:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 823 states have (on average 1.330498177399757) internal successors, (1095), 825 states have internal predecessors, (1095), 178 states have call successors, (178), 44 states have call predecessors, (178), 44 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-08 15:25:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1451 transitions. [2025-03-08 15:25:05,271 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1451 transitions. Word has length 375 [2025-03-08 15:25:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1451 transitions. [2025-03-08 15:25:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.692307692307692) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (56), 4 states have call predecessors, (56), 6 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-08 15:25:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1451 transitions. [2025-03-08 15:25:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-08 15:25:05,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:05,276 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:05,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:25:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 15:25:05,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:05,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1999994459, now seen corresponding path program 1 times [2025-03-08 15:25:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328136926] [2025-03-08 15:25:05,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:05,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:25:05,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:25:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:25:05,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760675366] [2025-03-08 15:25:05,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:05,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:05,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:05,887 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:05,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:25:06,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-08 15:25:06,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-08 15:25:06,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:06,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:06,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 15:25:06,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4092 proven. 144 refuted. 0 times theorem prover too weak. 1924 trivial. 0 not checked. [2025-03-08 15:25:06,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:25:11,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_58~0 65536)) (.cse4 (mod c_~var_1_35~0 256))) (let ((.cse2 (< .cse1 .cse4)) (.cse3 (< .cse4 (+ .cse1 1))) (.cse0 (mod c_~var_1_7~0 4294967296))) (and (or (and (or (< (mod (div .cse0 .cse1) 4294967296) 1) .cse2) (or .cse3 (< (div .cse0 .cse4) 1))) (< 4294967294 .cse0)) (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (mod (div v_z_38 .cse1) 4294967296) 1) (< v_z_38 0))) .cse2) (or .cse3 (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< v_z_38 0) (< (div v_z_38 .cse4) 1))))))) is different from false [2025-03-08 15:25:16,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_35~0 256)) (.cse3 (mod c_~var_1_58~0 65536))) (let ((.cse2 (< .cse1 (+ .cse3 1))) (.cse0 (mod c_~var_1_7~0 4294967296)) (.cse4 (< .cse3 .cse1))) (and (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (div v_z_38 .cse1) 1))) .cse2) (or (and (or (< (mod (div .cse0 .cse3) 4294967296) 1) .cse4) (or .cse2 (< (div .cse0 .cse1) 1))) (< 4294967294 .cse0)) (or (forall ((v_z_38 Int)) (or (< .cse0 v_z_38) (< (mod (div v_z_38 .cse3) 4294967296) 1) (< v_z_38 0))) .cse4)))) is different from false [2025-03-08 15:25:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-08 15:25:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328136926] [2025-03-08 15:25:39,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:25:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760675366] [2025-03-08 15:25:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760675366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:25:39,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:25:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-03-08 15:25:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540958883] [2025-03-08 15:25:39,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:25:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:25:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:39,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:25:39,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=179, Unknown=2, NotChecked=58, Total=306 [2025-03-08 15:25:39,549 INFO L87 Difference]: Start difference. First operand 1046 states and 1451 transitions. Second operand has 18 states, 18 states have (on average 9.833333333333334) internal successors, (177), 18 states have internal predecessors, (177), 4 states have call successors, (91), 3 states have call predecessors, (91), 6 states have return successors, (92), 4 states have call predecessors, (92), 4 states have call successors, (92) [2025-03-08 15:25:45,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:25:50,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~var_1_35~0 256)) (.cse1 (mod c_~var_1_58~0 65536))) (let ((.cse3 (< .cse4 (+ .cse1 1))) (.cse2 (< .cse1 .cse4)) (.cse0 (mod c_~var_1_75~0 256))) (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (< 5 .cse0) (and (or (< (mod (div .cse0 .cse1) 4294967296) 1) .cse2) (or .cse2 (forall ((v_z_38 Int)) (or (< (mod (div v_z_38 .cse1) 4294967296) 1) (< v_z_38 0) (< .cse0 v_z_38)))) (or .cse3 (< (div .cse0 .cse4) 1)))) (or (and (or (< (mod (div 5 .cse1) 4294967296) 1) .cse2) (or (< (div 5 .cse4) 1) .cse3) (or (forall ((v_z_38 Int)) (or (< (mod (div v_z_38 .cse1) 4294967296) 1) (< v_z_38 0) (< 5 v_z_38))) .cse2)) (< .cse0 6))))) is different from false [2025-03-08 15:25:54,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:25:59,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:26:03,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:26:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]