./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.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 a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:09:49,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:09:49,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:09:49,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:09:49,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:09:49,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:09:49,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:09:49,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:09:49,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:09:49,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:09:49,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:09:49,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:09:49,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:09:49,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:09:49,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:09:49,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:09:49,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:09:49,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:09:49,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:09:49,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:09:49,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:09:49,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:09:49,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:09:49,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:09:49,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:09:49,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:09:49,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:09:49,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:09:49,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:09:49,099 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 -> a84128d9dc2647965d087aabf3251d6852e74faf39ebdf7a8caa157044f8c0e2 [2025-03-03 21:09:49,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:09:49,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:09:49,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:09:49,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:09:49,322 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:09:49,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-03 21:09:50,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27f8ac0c/744bcc812c644c4bb95be678a48ab3b4/FLAG861ce4f79 [2025-03-03 21:09:50,622 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:09:50,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-03 21:09:50,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27f8ac0c/744bcc812c644c4bb95be678a48ab3b4/FLAG861ce4f79 [2025-03-03 21:09:50,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27f8ac0c/744bcc812c644c4bb95be678a48ab3b4 [2025-03-03 21:09:50,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:09:50,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:09:50,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:09:50,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:09:50,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:09:50,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:09:50" (1/1) ... [2025-03-03 21:09:50,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be81718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:50, skipping insertion in model container [2025-03-03 21:09:50,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:09:50" (1/1) ... [2025-03-03 21:09:50,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:09:51,092 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_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-03-03 21:09:51,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:09:51,166 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:09:51,175 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_fillercode_fillercodestructure_filler-pr-ci_file-9.i[918,931] [2025-03-03 21:09:51,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:09:51,225 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:09:51,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51 WrapperNode [2025-03-03 21:09:51,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:09:51,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:09:51,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:09:51,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:09:51,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,276 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-03-03 21:09:51,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:09:51,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:09:51,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:09:51,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:09:51,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:09:51,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:09:51,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:09:51,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:09:51,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:09:51,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (1/1) ... [2025-03-03 21:09:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:09:51,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:09:51,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:09:51,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:09:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:09:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:09:51,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:09:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:09:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:09:51,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:09:51,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:09:51,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:09:51,684 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-03 21:09:51,712 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 21:09:51,712 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:09:51,729 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:09:51,730 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:09:51,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:51 BoogieIcfgContainer [2025-03-03 21:09:51,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:09:51,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:09:51,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:09:51,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:09:51,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:09:50" (1/3) ... [2025-03-03 21:09:51,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f1f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:51, skipping insertion in model container [2025-03-03 21:09:51,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:09:51" (2/3) ... [2025-03-03 21:09:51,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f1f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:09:51, skipping insertion in model container [2025-03-03 21:09:51,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:09:51" (3/3) ... [2025-03-03 21:09:51,737 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i [2025-03-03 21:09:51,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:09:51,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-9.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:09:51,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:09:51,805 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;@1edb97d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:09:51,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:09:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:09:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:09:51,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:51,816 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:51,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 78330427, now seen corresponding path program 1 times [2025-03-03 21:09:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374179962] [2025-03-03 21:09:51,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:09:51,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:09:51,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:51,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 21:09:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374179962] [2025-03-03 21:09:52,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374179962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:09:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260921786] [2025-03-03 21:09:52,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:09:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:09:52,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:09:52,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:09:52,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:09:52,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:09:52,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:52,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:52,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:09:52,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 21:09:52,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:09:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260921786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:52,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:09:52,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:09:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561856817] [2025-03-03 21:09:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:09:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:52,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:09:52,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:09:52,248 INFO L87 Difference]: Start difference. First operand has 96 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:09:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:52,273 INFO L93 Difference]: Finished difference Result 186 states and 312 transitions. [2025-03-03 21:09:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:09:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2025-03-03 21:09:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:52,279 INFO L225 Difference]: With dead ends: 186 [2025-03-03 21:09:52,279 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 21:09:52,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-03 21:09:52,283 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:52,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 21:09:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 21:09:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:09:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2025-03-03 21:09:52,313 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2025-03-03 21:09:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:52,313 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2025-03-03 21:09:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 21:09:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2025-03-03 21:09:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 21:09:52,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:52,316 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:52,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:09:52,522 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-03 21:09:52,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:52,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1769525890, now seen corresponding path program 1 times [2025-03-03 21:09:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54577746] [2025-03-03 21:09:52,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:52,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 21:09:52,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 21:09:52,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:52,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:09:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54577746] [2025-03-03 21:09:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54577746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:52,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:09:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858054771] [2025-03-03 21:09:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:52,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:52,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:52,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:52,758 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:09:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:52,796 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2025-03-03 21:09:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2025-03-03 21:09:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:52,798 INFO L225 Difference]: With dead ends: 184 [2025-03-03 21:09:52,798 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 21:09:52,798 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-03 21:09:52,799 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:52,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:09:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 21:09:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 21:09:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 21:09:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2025-03-03 21:09:52,807 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2025-03-03 21:09:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-03-03 21:09:52,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:09:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2025-03-03 21:09:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:09:52,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:52,809 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:09:52,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:52,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2020996478, now seen corresponding path program 1 times [2025-03-03 21:09:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255759182] [2025-03-03 21:09:52,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:09:52,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:09:52,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:52,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:09:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255759182] [2025-03-03 21:09:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255759182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:09:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:09:52,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:09:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115788187] [2025-03-03 21:09:52,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:09:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:09:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:52,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:09:52,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:09:52,968 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:09:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:53,039 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2025-03-03 21:09:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:09:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:09:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:53,044 INFO L225 Difference]: With dead ends: 261 [2025-03-03 21:09:53,044 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 21:09:53,045 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-03 21:09:53,045 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 305 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:09:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 21:09:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-03-03 21:09:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 133 states have internal predecessors, (188), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:09:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2025-03-03 21:09:53,075 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 138 [2025-03-03 21:09:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:53,075 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2025-03-03 21:09:53,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:09:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2025-03-03 21:09:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:09:53,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:53,079 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:53,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:09:53,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 224045119, now seen corresponding path program 1 times [2025-03-03 21:09:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991655682] [2025-03-03 21:09:53,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:53,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:09:53,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:09:53,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:53,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:09:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:09:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991655682] [2025-03-03 21:09:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991655682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:09:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009802400] [2025-03-03 21:09:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:09:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:09:56,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:09:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:09:56,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:09:56,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:09:56,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:56,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:09:56,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:09:56,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:09:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-03 21:09:56,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:09:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:09:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009802400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:09:56,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:09:56,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 20 [2025-03-03 21:09:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059074852] [2025-03-03 21:09:56,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:09:56,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:09:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:09:56,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:09:56,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:09:56,687 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-03 21:09:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:09:58,675 INFO L93 Difference]: Finished difference Result 588 states and 885 transitions. [2025-03-03 21:09:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:09:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2025-03-03 21:09:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:09:58,680 INFO L225 Difference]: With dead ends: 588 [2025-03-03 21:09:58,682 INFO L226 Difference]: Without dead ends: 424 [2025-03-03 21:09:58,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2025-03-03 21:09:58,685 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 755 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:09:58,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 511 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:09:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-03 21:09:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 175. [2025-03-03 21:09:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.391304347826087) internal successors, (192), 139 states have internal predecessors, (192), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:09:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 256 transitions. [2025-03-03 21:09:58,714 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 256 transitions. Word has length 138 [2025-03-03 21:09:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:09:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 256 transitions. [2025-03-03 21:09:58,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-03 21:09:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 256 transitions. [2025-03-03 21:09:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:09:58,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:09:58,716 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:09:58,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:09:58,919 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,SelfDestructingSolverStorable3 [2025-03-03 21:09:58,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:09:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:09:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1814011170, now seen corresponding path program 1 times [2025-03-03 21:09:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:09:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111789253] [2025-03-03 21:09:58,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:09:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:09:58,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:09:58,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:09:58,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:09:58,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111789253] [2025-03-03 21:10:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111789253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179033275] [2025-03-03 21:10:01,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:01,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:01,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:01,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:10:01,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 21:10:01,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:01,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:01,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:01,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:10:01,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-03 21:10:01,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179033275] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:10:03,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 11] total 27 [2025-03-03 21:10:03,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825394589] [2025-03-03 21:10:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:03,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:10:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:03,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:10:03,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-03-03 21:10:03,094 INFO L87 Difference]: Start difference. First operand 175 states and 256 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:05,389 INFO L93 Difference]: Finished difference Result 823 states and 1214 transitions. [2025-03-03 21:10:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:10:05,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:10:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:05,393 INFO L225 Difference]: With dead ends: 823 [2025-03-03 21:10:05,393 INFO L226 Difference]: Without dead ends: 651 [2025-03-03 21:10:05,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:10:05,397 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 532 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:05,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 531 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 21:10:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-03 21:10:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 464. [2025-03-03 21:10:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 413 states have (on average 1.4673123486682809) internal successors, (606), 416 states have internal predecessors, (606), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 21:10:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 690 transitions. [2025-03-03 21:10:05,429 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 690 transitions. Word has length 138 [2025-03-03 21:10:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:05,430 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 690 transitions. [2025-03-03 21:10:05,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 690 transitions. [2025-03-03 21:10:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:10:05,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:05,431 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:05,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:10:05,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:05,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1313106342, now seen corresponding path program 1 times [2025-03-03 21:10:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536550645] [2025-03-03 21:10:05,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:05,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:05,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:05,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:05,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536550645] [2025-03-03 21:10:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536550645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193461666] [2025-03-03 21:10:07,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:07,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:07,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:07,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:10:07,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:10:07,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:08,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:08,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 21:10:08,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-03 21:10:08,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193461666] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:09,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:10:09,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 12] total 26 [2025-03-03 21:10:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541882778] [2025-03-03 21:10:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:09,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:10:09,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:09,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:10:09,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:10:09,476 INFO L87 Difference]: Start difference. First operand 464 states and 690 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:11,398 INFO L93 Difference]: Finished difference Result 1434 states and 2116 transitions. [2025-03-03 21:10:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:10:11,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:10:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:11,402 INFO L225 Difference]: With dead ends: 1434 [2025-03-03 21:10:11,402 INFO L226 Difference]: Without dead ends: 973 [2025-03-03 21:10:11,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:10:11,403 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 529 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:11,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 586 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 21:10:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-03-03 21:10:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 468. [2025-03-03 21:10:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 417 states have (on average 1.4676258992805755) internal successors, (612), 420 states have internal predecessors, (612), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 21:10:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 696 transitions. [2025-03-03 21:10:11,435 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 696 transitions. Word has length 138 [2025-03-03 21:10:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:11,435 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 696 transitions. [2025-03-03 21:10:11,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 696 transitions. [2025-03-03 21:10:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:10:11,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:11,436 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:11,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 21:10:11,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:11,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:11,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 403746783, now seen corresponding path program 1 times [2025-03-03 21:10:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056394429] [2025-03-03 21:10:11,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:11,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:11,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:11,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:11,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056394429] [2025-03-03 21:10:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056394429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250305009] [2025-03-03 21:10:13,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:13,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:13,295 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-03 21:10:13,296 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-03 21:10:13,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:13,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:13,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:13,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:13,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 21:10:13,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 332 proven. 66 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-03 21:10:13,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 21:10:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250305009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:10:14,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:10:14,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 30 [2025-03-03 21:10:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44609753] [2025-03-03 21:10:14,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:10:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 21:10:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:14,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 21:10:14,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:10:14,611 INFO L87 Difference]: Start difference. First operand 468 states and 696 transitions. Second operand has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-03 21:10:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:29,012 INFO L93 Difference]: Finished difference Result 2802 states and 4139 transitions. [2025-03-03 21:10:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 21:10:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2025-03-03 21:10:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:29,026 INFO L225 Difference]: With dead ends: 2802 [2025-03-03 21:10:29,026 INFO L226 Difference]: Without dead ends: 2337 [2025-03-03 21:10:29,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=784, Invalid=4328, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 21:10:29,029 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2263 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 4887 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 5176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:29,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2893 Invalid, 5176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4887 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2025-03-03 21:10:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-03-03 21:10:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 855. [2025-03-03 21:10:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 750 states have (on average 1.456) internal successors, (1092), 756 states have internal predecessors, (1092), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:10:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1260 transitions. [2025-03-03 21:10:29,087 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1260 transitions. Word has length 138 [2025-03-03 21:10:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:29,088 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1260 transitions. [2025-03-03 21:10:29,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.266666666666667) internal successors, (128), 30 states have internal predecessors, (128), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2025-03-03 21:10:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1260 transitions. [2025-03-03 21:10:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:10:29,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:29,091 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:29,099 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-03 21:10:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:29,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:29,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2068747715, now seen corresponding path program 1 times [2025-03-03 21:10:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241234670] [2025-03-03 21:10:29,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:29,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:29,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:29,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:29,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241234670] [2025-03-03 21:10:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241234670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532156785] [2025-03-03 21:10:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:29,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:29,838 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-03 21:10:29,840 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-03 21:10:29,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:30,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:30,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:30,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:30,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 21:10:30,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 330 proven. 18 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-03 21:10:30,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532156785] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:31,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:10:31,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2025-03-03 21:10:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939589779] [2025-03-03 21:10:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:31,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:10:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:31,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:10:31,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:10:31,018 INFO L87 Difference]: Start difference. First operand 855 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:32,513 INFO L93 Difference]: Finished difference Result 2161 states and 3182 transitions. [2025-03-03 21:10:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:10:32,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:10:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:32,527 INFO L225 Difference]: With dead ends: 2161 [2025-03-03 21:10:32,528 INFO L226 Difference]: Without dead ends: 1309 [2025-03-03 21:10:32,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-03 21:10:32,529 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 349 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:32,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 941 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 21:10:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-03-03 21:10:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 883. [2025-03-03 21:10:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 778 states have (on average 1.4524421593830334) internal successors, (1130), 784 states have internal predecessors, (1130), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:10:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1298 transitions. [2025-03-03 21:10:32,565 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1298 transitions. Word has length 138 [2025-03-03 21:10:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:32,566 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1298 transitions. [2025-03-03 21:10:32,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1298 transitions. [2025-03-03 21:10:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 21:10:32,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:32,567 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:32,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 21:10:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:32,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1567842887, now seen corresponding path program 1 times [2025-03-03 21:10:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003696919] [2025-03-03 21:10:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:32,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:32,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:33,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003696919] [2025-03-03 21:10:33,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003696919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:33,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013563604] [2025-03-03 21:10:33,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:33,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:10:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 21:10:33,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 21:10:33,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 21:10:33,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:33,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:33,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 21:10:33,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 450 proven. 84 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-03 21:10:34,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013563604] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:10:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:10:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 18] total 28 [2025-03-03 21:10:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120530645] [2025-03-03 21:10:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:10:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:34,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:10:34,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:10:34,969 INFO L87 Difference]: Start difference. First operand 883 states and 1298 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:36,616 INFO L93 Difference]: Finished difference Result 2699 states and 3948 transitions. [2025-03-03 21:10:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:10:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2025-03-03 21:10:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:36,622 INFO L225 Difference]: With dead ends: 2699 [2025-03-03 21:10:36,622 INFO L226 Difference]: Without dead ends: 1819 [2025-03-03 21:10:36,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 21:10:36,624 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 621 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:36,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 952 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:10:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-03-03 21:10:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1059. [2025-03-03 21:10:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 954 states have (on average 1.471698113207547) internal successors, (1404), 960 states have internal predecessors, (1404), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:10:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1572 transitions. [2025-03-03 21:10:36,683 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1572 transitions. Word has length 138 [2025-03-03 21:10:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:36,683 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1572 transitions. [2025-03-03 21:10:36,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1572 transitions. [2025-03-03 21:10:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:10:36,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:36,685 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:36,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 21:10:36,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:36,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -334411428, now seen corresponding path program 1 times [2025-03-03 21:10:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:36,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390751612] [2025-03-03 21:10:36,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:36,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:36,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:10:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:10:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:10:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850460138] [2025-03-03 21:10:36,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:36,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:36,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:10:36,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 21:10:36,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:10:37,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:10:37,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:37,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:37,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 21:10:37,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 21:10:37,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:10:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-03 21:10:37,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:37,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390751612] [2025-03-03 21:10:37,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:10:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850460138] [2025-03-03 21:10:37,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850460138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:10:37,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:10:37,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-03 21:10:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996044061] [2025-03-03 21:10:37,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:10:37,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:10:37,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:37,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:10:37,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:10:37,383 INFO L87 Difference]: Start difference. First operand 1059 states and 1572 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:10:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:38,082 INFO L93 Difference]: Finished difference Result 2792 states and 4025 transitions. [2025-03-03 21:10:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:10:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 140 [2025-03-03 21:10:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:38,088 INFO L225 Difference]: With dead ends: 2792 [2025-03-03 21:10:38,088 INFO L226 Difference]: Without dead ends: 1736 [2025-03-03 21:10:38,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-03-03 21:10:38,090 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 337 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:38,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 739 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:10:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-03-03 21:10:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1057. [2025-03-03 21:10:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 960 states have (on average 1.4479166666666667) internal successors, (1390), 966 states have internal predecessors, (1390), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 21:10:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1534 transitions. [2025-03-03 21:10:38,152 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1534 transitions. Word has length 140 [2025-03-03 21:10:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:38,152 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1534 transitions. [2025-03-03 21:10:38,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-03 21:10:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1534 transitions. [2025-03-03 21:10:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:10:38,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:38,154 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:38,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 21:10:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:10:38,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1208872, now seen corresponding path program 1 times [2025-03-03 21:10:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:38,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813140365] [2025-03-03 21:10:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:38,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:10:38,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:10:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813140365] [2025-03-03 21:10:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813140365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:10:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621155748] [2025-03-03 21:10:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:38,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:10:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:38,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:10:38,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:10:38,399 INFO L87 Difference]: Start difference. First operand 1057 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:38,501 INFO L93 Difference]: Finished difference Result 2321 states and 3334 transitions. [2025-03-03 21:10:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:10:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-03 21:10:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:38,506 INFO L225 Difference]: With dead ends: 2321 [2025-03-03 21:10:38,506 INFO L226 Difference]: Without dead ends: 1267 [2025-03-03 21:10:38,508 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-03 21:10:38,508 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:38,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 251 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:10:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-03 21:10:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2025-03-03 21:10:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1060 states have (on average 1.3962264150943395) internal successors, (1480), 1069 states have internal predecessors, (1480), 134 states have call successors, (134), 42 states have call predecessors, (134), 42 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-03 21:10:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1748 transitions. [2025-03-03 21:10:38,566 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1748 transitions. Word has length 140 [2025-03-03 21:10:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:38,566 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1748 transitions. [2025-03-03 21:10:38,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1748 transitions. [2025-03-03 21:10:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 21:10:38,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:38,568 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:38,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:10:38,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:38,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 221817114, now seen corresponding path program 1 times [2025-03-03 21:10:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146681056] [2025-03-03 21:10:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:38,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 21:10:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 21:10:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146681056] [2025-03-03 21:10:39,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146681056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:39,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:10:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751698066] [2025-03-03 21:10:39,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:39,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:10:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:39,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:10:39,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:10:39,118 INFO L87 Difference]: Start difference. First operand 1237 states and 1748 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:39,761 INFO L93 Difference]: Finished difference Result 3974 states and 5460 transitions. [2025-03-03 21:10:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:10:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2025-03-03 21:10:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:39,770 INFO L225 Difference]: With dead ends: 3974 [2025-03-03 21:10:39,770 INFO L226 Difference]: Without dead ends: 2752 [2025-03-03 21:10:39,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:10:39,773 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 276 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:39,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 490 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:10:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-03-03 21:10:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 1919. [2025-03-03 21:10:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1661 states have (on average 1.3895243829018664) internal successors, (2308), 1678 states have internal predecessors, (2308), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-03 21:10:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2682 transitions. [2025-03-03 21:10:39,904 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2682 transitions. Word has length 140 [2025-03-03 21:10:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 2682 transitions. [2025-03-03 21:10:39,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2682 transitions. [2025-03-03 21:10:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:10:39,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:39,907 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:10:39,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2023225590, now seen corresponding path program 1 times [2025-03-03 21:10:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:39,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628499400] [2025-03-03 21:10:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:10:39,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:10:39,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:41,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628499400] [2025-03-03 21:10:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628499400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:10:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140132675] [2025-03-03 21:10:41,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:41,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:10:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:41,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:10:41,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:10:41,317 INFO L87 Difference]: Start difference. First operand 1919 states and 2682 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:43,393 INFO L93 Difference]: Finished difference Result 4002 states and 5603 transitions. [2025-03-03 21:10:43,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:10:43,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2025-03-03 21:10:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:43,401 INFO L225 Difference]: With dead ends: 4002 [2025-03-03 21:10:43,401 INFO L226 Difference]: Without dead ends: 2124 [2025-03-03 21:10:43,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:10:43,406 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 389 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:43,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1184 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 21:10:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2025-03-03 21:10:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1986. [2025-03-03 21:10:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1728 states have (on average 1.3796296296296295) internal successors, (2384), 1745 states have internal predecessors, (2384), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-03 21:10:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2758 transitions. [2025-03-03 21:10:43,526 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2758 transitions. Word has length 141 [2025-03-03 21:10:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:43,526 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2758 transitions. [2025-03-03 21:10:43,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2758 transitions. [2025-03-03 21:10:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:10:43,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:43,529 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:43,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:10:43,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:43,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:43,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1800199604, now seen corresponding path program 1 times [2025-03-03 21:10:43,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:43,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214224849] [2025-03-03 21:10:43,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:43,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:10:43,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:10:43,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:43,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:10:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:10:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214224849] [2025-03-03 21:10:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214224849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:10:43,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:10:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:10:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659648406] [2025-03-03 21:10:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:10:43,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:10:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:10:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:10:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:10:43,866 INFO L87 Difference]: Start difference. First operand 1986 states and 2758 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:10:44,539 INFO L93 Difference]: Finished difference Result 4527 states and 6199 transitions. [2025-03-03 21:10:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:10:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2025-03-03 21:10:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:10:44,548 INFO L225 Difference]: With dead ends: 4527 [2025-03-03 21:10:44,548 INFO L226 Difference]: Without dead ends: 2582 [2025-03-03 21:10:44,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:10:44,551 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 199 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:10:44,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 635 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:10:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2025-03-03 21:10:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1898. [2025-03-03 21:10:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1640 states have (on average 1.3676829268292683) internal successors, (2243), 1657 states have internal predecessors, (2243), 187 states have call successors, (187), 70 states have call predecessors, (187), 70 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-03 21:10:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2617 transitions. [2025-03-03 21:10:44,688 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2617 transitions. Word has length 141 [2025-03-03 21:10:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:10:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2617 transitions. [2025-03-03 21:10:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 21:10:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2617 transitions. [2025-03-03 21:10:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 21:10:44,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:10:44,691 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:10:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:10:44,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:10:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:10:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1211444662, now seen corresponding path program 1 times [2025-03-03 21:10:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:10:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455577037] [2025-03-03 21:10:44,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:10:44,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:10:44,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:10:44,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:44,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:10:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553658791] [2025-03-03 21:10:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:10:44,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:10:44,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:10:44,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:10:44,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 21:10:44,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 21:10:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 21:10:44,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:10:44,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:10:44,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 21:10:44,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:10:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-03 21:10:45,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:11:18,554 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (mod c_~var_1_10~0 256) 0)) (< c_~var_1_6~0 0) (let ((.cse6 (mod c_~var_1_7~0 256))) (let ((.cse0 (< (+ (mod c_~last_1_var_1_12~0 65536) c_~var_1_7~0) c_~var_1_6~0)) (.cse23 (not (= (mod c_~var_1_6~0 c_~var_1_6~0) 0))) (.cse9 (< 0 .cse6)) (.cse1 (< .cse6 1)) (.cse3 (+ c_~var_1_6~0 .cse6)) (.cse5 (* (- 1) .cse6))) (and (or (forall ((~var_1_3~0 Int)) (or (< c_~var_1_6~0 ~var_1_3~0) (= (mod ~var_1_3~0 c_~var_1_6~0) 0) (< (div ~var_1_3~0 c_~var_1_6~0) 1))) .cse0) (or .cse1 (forall ((v_y_21 Int)) (let ((.cse4 (* v_y_21 256))) (let ((.cse2 (+ 256 .cse5 .cse4))) (or (not (= (mod .cse2 c_~var_1_6~0) 0)) (< (div .cse2 c_~var_1_6~0) 0) (< .cse3 (+ 256 .cse4))))))) (or (forall ((v_y_48 Int)) (let ((.cse7 (* v_y_48 256))) (let ((.cse8 (+ .cse7 .cse5))) (or (< .cse6 (+ .cse7 1)) (< (+ (div .cse8 c_~var_1_6~0) 1) 0) (= (mod .cse8 c_~var_1_6~0) 0))))) .cse9) (or .cse1 (forall ((v_y_41 Int)) (let ((.cse10 (* v_y_41 256))) (or (< .cse3 (+ 256 .cse10)) (< (div (+ 256 .cse10 .cse5) c_~var_1_6~0) 0))))) (or (forall ((~var_1_3~0 Int)) (or (< c_~var_1_6~0 ~var_1_3~0) (< (div ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or (forall ((v_y_32 Int)) (let ((.cse12 (* v_y_32 256))) (let ((.cse11 (+ .cse12 .cse5))) (or (< (div .cse11 c_~var_1_6~0) 0) (< .cse3 .cse12) (not (= (mod .cse11 c_~var_1_6~0) 0)))))) .cse9) (or (forall ((v_y_21 Int)) (let ((.cse14 (* v_y_21 256))) (let ((.cse13 (+ .cse5 .cse14))) (or (< (div .cse13 c_~var_1_6~0) 0) (not (= (mod .cse13 c_~var_1_6~0) 0)) (< .cse3 .cse14))))) .cse9) (or (forall ((~var_1_3~0 Int)) (or (not (= (mod ~var_1_3~0 c_~var_1_6~0) 0)) (< c_~var_1_6~0 ~var_1_3~0) (< (div ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or (forall ((v_y_41 Int)) (let ((.cse15 (* v_y_41 256))) (or (< .cse3 .cse15) (< (div (+ .cse15 .cse5) c_~var_1_6~0) 0)))) .cse9) (or .cse1 (forall ((v_y_39 Int)) (let ((.cse16 (* v_y_39 256))) (let ((.cse17 (+ .cse16 256 .cse5))) (or (< .cse3 (+ .cse16 256)) (< (div .cse17 c_~var_1_6~0) 0) (not (= (mod .cse17 c_~var_1_6~0) 0))))))) (or (forall ((~var_1_3~0 Int)) (let ((.cse18 (div ~var_1_3~0 c_~var_1_6~0))) (or (< c_~var_1_6~0 ~var_1_3~0) (= .cse18 0) (< .cse18 0)))) .cse0) (or (and (or (forall ((v_y_22 Int)) (let ((.cse20 (* v_y_22 256))) (let ((.cse19 (+ .cse20 .cse5))) (or (not (= (mod .cse19 c_~var_1_6~0) 0)) (< (div .cse19 c_~var_1_6~0) 0) (< .cse3 .cse20))))) .cse9) (or .cse1 (forall ((v_y_22 Int)) (let ((.cse22 (* v_y_22 256))) (let ((.cse21 (+ 256 .cse22 .cse5))) (or (< (div .cse21 c_~var_1_6~0) 0) (< .cse3 (+ 256 .cse22)) (not (= (mod .cse21 c_~var_1_6~0) 0)))))))) .cse23) (or (forall ((~var_1_3~0 Int)) (or (< (+ (div ~var_1_3~0 c_~var_1_6~0) 1) 0) (< 0 (+ ~var_1_3~0 1)) (= (mod ~var_1_3~0 c_~var_1_6~0) 0))) .cse0) (or (forall ((v_y_42 Int)) (let ((.cse25 (* v_y_42 256))) (let ((.cse24 (div (+ .cse25 .cse5) c_~var_1_6~0))) (or (= .cse24 0) (< .cse3 .cse25) (< .cse24 0))))) .cse9) (or .cse1 (forall ((v_y_47 Int)) (let ((.cse27 (* v_y_47 256))) (let ((.cse26 (+ 256 .cse27 .cse5))) (or (= (mod .cse26 c_~var_1_6~0) 0) (< (div .cse26 c_~var_1_6~0) 1) (< .cse3 (+ 256 .cse27))))))) (or .cse1 (forall ((v_y_32 Int)) (let ((.cse28 (* v_y_32 256))) (let ((.cse29 (+ .cse28 256 .cse5))) (or (< .cse3 (+ .cse28 256)) (< (div .cse29 c_~var_1_6~0) 0) (not (= (mod .cse29 c_~var_1_6~0) 0))))))) (or (and (or (forall ((v_y_43 Int)) (let ((.cse31 (* v_y_43 256))) (let ((.cse30 (div (+ .cse31 .cse5) c_~var_1_6~0))) (or (= .cse30 0) (< .cse30 0) (< .cse3 .cse31))))) .cse9) (or .cse1 (forall ((v_y_43 Int)) (let ((.cse33 (* v_y_43 256))) (let ((.cse32 (div (+ .cse33 256 .cse5) c_~var_1_6~0))) (or (< .cse32 0) (< .cse3 (+ .cse33 256)) (= .cse32 0))))))) .cse23) (or .cse1 (forall ((v_y_48 Int)) (let ((.cse35 (* v_y_48 256))) (let ((.cse34 (+ .cse35 256 .cse5))) (or (< (+ (div .cse34 c_~var_1_6~0) 1) 0) (= (mod .cse34 c_~var_1_6~0) 0) (< .cse6 (+ 257 .cse35))))))) (<= (+ 1 (div c_~var_1_6~0 c_~var_1_6~0)) 0) (or (forall ((v_y_47 Int)) (let ((.cse37 (* v_y_47 256))) (let ((.cse36 (+ .cse37 .cse5))) (or (= (mod .cse36 c_~var_1_6~0) 0) (< (div .cse36 c_~var_1_6~0) 1) (< .cse3 .cse37))))) .cse9) (or .cse1 (forall ((v_y_42 Int)) (let ((.cse38 (* v_y_42 256))) (let ((.cse39 (div (+ 256 .cse38 .cse5) c_~var_1_6~0))) (or (< .cse3 (+ 256 .cse38)) (< .cse39 0) (= .cse39 0)))))) (or (forall ((v_y_39 Int)) (let ((.cse40 (* v_y_39 256))) (let ((.cse41 (+ .cse40 .cse5))) (or (< .cse3 .cse40) (< (div .cse41 c_~var_1_6~0) 0) (not (= (mod .cse41 c_~var_1_6~0) 0)))))) .cse9) (or .cse23 (and (or (forall ((v_y_46 Int)) (let ((.cse42 (* v_y_46 256))) (let ((.cse43 (+ .cse42 .cse5))) (or (< .cse3 .cse42) (< (div .cse43 c_~var_1_6~0) 1) (= (mod .cse43 c_~var_1_6~0) 0))))) .cse9) (or .cse1 (forall ((v_y_46 Int)) (let ((.cse45 (* v_y_46 256))) (let ((.cse44 (+ 256 .cse45 .cse5))) (or (< (div .cse44 c_~var_1_6~0) 1) (< .cse3 (+ 256 .cse45)) (= (mod .cse44 c_~var_1_6~0) 0)))))))))))) is different from true [2025-03-03 21:11:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 21:11:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:11:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455577037] [2025-03-03 21:11:19,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:11:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553658791] [2025-03-03 21:11:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553658791] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 21:11:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:11:19,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-03 21:11:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172031703] [2025-03-03 21:11:19,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:11:19,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:11:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:11:19,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:11:19,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=203, Unknown=6, NotChecked=30, Total=306 [2025-03-03 21:11:19,832 INFO L87 Difference]: Start difference. First operand 1898 states and 2617 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)