./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c130d3d9fa60b2bea9bba7adbf819cbc71aada0924db06d5b1e68ee6ed3ed16
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 23:45:20,232 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 23:45:20,327 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 23:45:20,333 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 23:45:20,333 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 23:45:20,374 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 23:45:20,375 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 23:45:20,375 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 23:45:20,375 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 23:45:20,375 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 23:45:20,375 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 23:45:20,375 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 23:45:20,375 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 23:45:20,375 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 23:45:20,375 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 23:45:20,375 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 23:45:20,376 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:45:20,376 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 23:45:20,376 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 23:45:20,377 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c130d3d9fa60b2bea9bba7adbf819cbc71aada0924db06d5b1e68ee6ed3ed16
[2025-02-05 23:45:20,608 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 23:45:20,615 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 23:45:20,618 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 23:45:20,619 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 23:45:20,619 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 23:45:20,620 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i
[2025-02-05 23:45:21,767 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1204a17ae/905284abbc034a1d9b652dc01a2e8d65/FLAG45450235d
[2025-02-05 23:45:22,024 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 23:45:22,027 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i
[2025-02-05 23:45:22,041 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1204a17ae/905284abbc034a1d9b652dc01a2e8d65/FLAG45450235d
[2025-02-05 23:45:22,340 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1204a17ae/905284abbc034a1d9b652dc01a2e8d65
[2025-02-05 23:45:22,342 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 23:45:22,345 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 23:45:22,345 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 23:45:22,346 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 23:45:22,349 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 23:45:22,353 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,353 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3df4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22, skipping insertion in model container
[2025-02-05 23:45:22,353 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,377 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 23:45:22,487 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i[919,932]
[2025-02-05 23:45:22,570 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:45:22,578 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 23:45:22,585 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i[919,932]
[2025-02-05 23:45:22,619 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:45:22,630 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 23:45:22,631 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22 WrapperNode
[2025-02-05 23:45:22,631 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 23:45:22,632 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 23:45:22,632 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 23:45:22,632 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 23:45:22,637 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,649 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,680 INFO  L138                Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249
[2025-02-05 23:45:22,680 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 23:45:22,681 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 23:45:22,681 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 23:45:22,681 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 23:45:22,687 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,688 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,690 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,703 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-02-05 23:45:22,703 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,703 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,710 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,711 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,713 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,717 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,721 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 23:45:22,721 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 23:45:22,722 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 23:45:22,722 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 23:45:22,722 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (1/1) ...
[2025-02-05 23:45:22,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:45:22,738 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:45:22,751 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 23:45:22,758 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 23:45:22,770 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 23:45:22,771 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 23:45:22,771 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 23:45:22,771 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 23:45:22,771 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 23:45:22,772 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 23:45:22,842 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 23:45:22,843 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 23:45:23,126 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;
[2025-02-05 23:45:23,154 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2025-02-05 23:45:23,154 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 23:45:23,174 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 23:45:23,175 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 23:45:23,175 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:45:23 BoogieIcfgContainer
[2025-02-05 23:45:23,175 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 23:45:23,177 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 23:45:23,177 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 23:45:23,180 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 23:45:23,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:45:22" (1/3) ...
[2025-02-05 23:45:23,181 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a8c3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:45:23, skipping insertion in model container
[2025-02-05 23:45:23,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:45:22" (2/3) ...
[2025-02-05 23:45:23,181 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51a8c3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:45:23, skipping insertion in model container
[2025-02-05 23:45:23,181 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:45:23" (3/3) ...
[2025-02-05 23:45:23,182 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i
[2025-02-05 23:45:23,193 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 23:45:23,195 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-33.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 23:45:23,233 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 23:45:23,241 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;@17e2a642, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 23:45:23,242 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 23:45:23,245 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 111 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42)
[2025-02-05 23:45:23,254 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2025-02-05 23:45:23,255 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:23,255 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:23,256 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:23,259 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:23,260 INFO  L85        PathProgramCache]: Analyzing trace with hash 2037136080, now seen corresponding path program 1 times
[2025-02-05 23:45:23,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:23,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385482931]
[2025-02-05 23:45:23,266 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:23,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:23,360 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-02-05 23:45:23,379 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-02-05 23:45:23,380 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:23,380 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:23,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked.
[2025-02-05 23:45:23,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:23,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385482931]
[2025-02-05 23:45:23,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385482931] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:45:23,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788902248]
[2025-02-05 23:45:23,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:23,563 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:45:23,563 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:45:23,565 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 23:45:23,566 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 23:45:23,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-02-05 23:45:23,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-02-05 23:45:23,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:23,716 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:23,723 INFO  L256         TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 23:45:23,732 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 23:45:23,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked.
[2025-02-05 23:45:23,759 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 23:45:23,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [788902248] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:45:23,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 23:45:23,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 23:45:23,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806479170]
[2025-02-05 23:45:23,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:45:23,764 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 23:45:23,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:45:23,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 23:45:23,780 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 23:45:23,783 INFO  L87              Difference]: Start difference. First operand  has 111 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42)
[2025-02-05 23:45:23,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:45:23,820 INFO  L93              Difference]: Finished difference Result 214 states and 385 transitions.
[2025-02-05 23:45:23,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 23:45:23,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 257
[2025-02-05 23:45:23,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:45:23,829 INFO  L225             Difference]: With dead ends: 214
[2025-02-05 23:45:23,829 INFO  L226             Difference]: Without dead ends: 106
[2025-02-05 23:45:23,835 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 258 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-02-05 23:45:23,839 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 23:45:23,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 23:45:23,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-02-05 23:45:23,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2025-02-05 23:45:23,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42)
[2025-02-05 23:45:23,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions.
[2025-02-05 23:45:23,894 INFO  L78                 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 257
[2025-02-05 23:45:23,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:45:23,896 INFO  L471      AbstractCegarLoop]: Abstraction has 106 states and 164 transitions.
[2025-02-05 23:45:23,896 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42)
[2025-02-05 23:45:23,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions.
[2025-02-05 23:45:23,900 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2025-02-05 23:45:23,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:23,900 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:23,908 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 23:45:24,101 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 23:45:24,101 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:24,102 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:24,104 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032474030, now seen corresponding path program 1 times
[2025-02-05 23:45:24,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:24,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724846823]
[2025-02-05 23:45:24,104 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:24,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:24,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-02-05 23:45:24,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-02-05 23:45:24,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:24,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:24,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked.
[2025-02-05 23:45:24,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:24,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724846823]
[2025-02-05 23:45:24,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724846823] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:45:24,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:45:24,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:45:24,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667543302]
[2025-02-05 23:45:24,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:45:24,956 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:45:24,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:45:24,959 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:45:24,959 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:45:24,959 INFO  L87              Difference]: Start difference. First operand 106 states and 164 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:25,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:45:25,269 INFO  L93              Difference]: Finished difference Result 317 states and 494 transitions.
[2025-02-05 23:45:25,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:45:25,269 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 257
[2025-02-05 23:45:25,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:45:25,272 INFO  L225             Difference]: With dead ends: 317
[2025-02-05 23:45:25,273 INFO  L226             Difference]: Without dead ends: 214
[2025-02-05 23:45:25,274 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:45:25,275 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 102 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 23:45:25,275 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 428 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 23:45:25,276 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2025-02-05 23:45:25,330 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200.
[2025-02-05 23:45:25,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 113 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84)
[2025-02-05 23:45:25,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions.
[2025-02-05 23:45:25,335 INFO  L78                 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 257
[2025-02-05 23:45:25,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:45:25,336 INFO  L471      AbstractCegarLoop]: Abstraction has 200 states and 313 transitions.
[2025-02-05 23:45:25,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:25,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions.
[2025-02-05 23:45:25,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 259
[2025-02-05 23:45:25,341 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:25,342 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:25,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 23:45:25,342 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:25,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:25,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1136225096, now seen corresponding path program 1 times
[2025-02-05 23:45:25,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:25,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269802507]
[2025-02-05 23:45:25,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:25,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:25,359 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes.
[2025-02-05 23:45:25,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements.
[2025-02-05 23:45:25,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:25,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:25,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked.
[2025-02-05 23:45:25,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:25,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269802507]
[2025-02-05 23:45:25,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269802507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:45:25,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:45:25,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:45:25,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100298396]
[2025-02-05 23:45:25,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:45:25,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:45:25,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:45:25,605 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:45:25,605 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:45:25,605 INFO  L87              Difference]: Start difference. First operand 200 states and 313 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:25,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:45:25,831 INFO  L93              Difference]: Finished difference Result 326 states and 505 transitions.
[2025-02-05 23:45:25,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:45:25,831 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 258
[2025-02-05 23:45:25,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:45:25,835 INFO  L225             Difference]: With dead ends: 326
[2025-02-05 23:45:25,836 INFO  L226             Difference]: Without dead ends: 210
[2025-02-05 23:45:25,837 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:45:25,837 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:45:25,838 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 433 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 23:45:25,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2025-02-05 23:45:25,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 201.
[2025-02-05 23:45:25,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84)
[2025-02-05 23:45:25,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions.
[2025-02-05 23:45:25,885 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 258
[2025-02-05 23:45:25,886 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:45:25,886 INFO  L471      AbstractCegarLoop]: Abstraction has 201 states and 313 transitions.
[2025-02-05 23:45:25,886 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:25,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions.
[2025-02-05 23:45:25,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-02-05 23:45:25,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:25,889 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:25,889 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 23:45:25,890 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:25,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:25,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -165363399, now seen corresponding path program 1 times
[2025-02-05 23:45:25,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:25,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52545637]
[2025-02-05 23:45:25,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:25,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:25,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-02-05 23:45:26,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-02-05 23:45:26,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:26,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:32,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked.
[2025-02-05 23:45:32,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:32,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52545637]
[2025-02-05 23:45:32,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52545637] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:45:32,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:45:32,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-02-05 23:45:32,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892989875]
[2025-02-05 23:45:32,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:45:32,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 23:45:32,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:45:32,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 23:45:32,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-02-05 23:45:32,371 INFO  L87              Difference]: Start difference. First operand 201 states and 313 transitions. Second operand  has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:34,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:45:34,642 INFO  L93              Difference]: Finished difference Result 494 states and 745 transitions.
[2025-02-05 23:45:34,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 23:45:34,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 259
[2025-02-05 23:45:34,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:45:34,647 INFO  L225             Difference]: With dead ends: 494
[2025-02-05 23:45:34,647 INFO  L226             Difference]: Without dead ends: 391
[2025-02-05 23:45:34,648 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600
[2025-02-05 23:45:34,648 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 347 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 23:45:34,648 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1403 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 23:45:34,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2025-02-05 23:45:34,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 338.
[2025-02-05 23:45:34,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 338 states, 207 states have (on average 1.289855072463768) internal successors, (267), 207 states have internal predecessors, (267), 126 states have call successors, (126), 4 states have call predecessors, (126), 4 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126)
[2025-02-05 23:45:34,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 519 transitions.
[2025-02-05 23:45:34,702 INFO  L78                 Accepts]: Start accepts. Automaton has 338 states and 519 transitions. Word has length 259
[2025-02-05 23:45:34,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:45:34,703 INFO  L471      AbstractCegarLoop]: Abstraction has 338 states and 519 transitions.
[2025-02-05 23:45:34,703 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42)
[2025-02-05 23:45:34,703 INFO  L276                IsEmpty]: Start isEmpty. Operand 338 states and 519 transitions.
[2025-02-05 23:45:34,705 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-02-05 23:45:34,706 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:34,706 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:34,706 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 23:45:34,706 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:34,707 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:34,707 INFO  L85        PathProgramCache]: Analyzing trace with hash -361876904, now seen corresponding path program 1 times
[2025-02-05 23:45:34,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:34,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356125825]
[2025-02-05 23:45:34,707 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:34,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:34,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-02-05 23:45:34,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-02-05 23:45:34,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:34,856 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:35,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked.
[2025-02-05 23:45:35,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:35,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356125825]
[2025-02-05 23:45:35,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356125825] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:45:35,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136354588]
[2025-02-05 23:45:35,010 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:35,010 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:45:35,010 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:45:35,013 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 23:45:35,014 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 23:45:35,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-02-05 23:45:35,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-02-05 23:45:35,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:35,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:35,120 INFO  L256         TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 23:45:35,129 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 23:45:35,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 1491 proven. 36 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked.
[2025-02-05 23:45:35,289 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 23:45:35,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked.
[2025-02-05 23:45:35,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136354588] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 23:45:35,503 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 23:45:35,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-02-05 23:45:35,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585222040]
[2025-02-05 23:45:35,504 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 23:45:35,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 23:45:35,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:45:35,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 23:45:35,505 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 23:45:35,506 INFO  L87              Difference]: Start difference. First operand 338 states and 519 transitions. Second operand  has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-02-05 23:45:35,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:45:35,757 INFO  L93              Difference]: Finished difference Result 614 states and 926 transitions.
[2025-02-05 23:45:35,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 23:45:35,757 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 259
[2025-02-05 23:45:35,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:45:35,760 INFO  L225             Difference]: With dead ends: 614
[2025-02-05 23:45:35,760 INFO  L226             Difference]: Without dead ends: 356
[2025-02-05 23:45:35,760 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-02-05 23:45:35,761 INFO  L435           NwaCegarLoop]: 114 mSDtfsCounter, 219 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:45:35,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 256 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 23:45:35,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2025-02-05 23:45:35,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350.
[2025-02-05 23:45:35,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 350 states, 216 states have (on average 1.2638888888888888) internal successors, (273), 216 states have internal predecessors, (273), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126)
[2025-02-05 23:45:35,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 525 transitions.
[2025-02-05 23:45:35,794 INFO  L78                 Accepts]: Start accepts. Automaton has 350 states and 525 transitions. Word has length 259
[2025-02-05 23:45:35,795 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:45:35,795 INFO  L471      AbstractCegarLoop]: Abstraction has 350 states and 525 transitions.
[2025-02-05 23:45:35,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67)
[2025-02-05 23:45:35,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 350 states and 525 transitions.
[2025-02-05 23:45:35,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-02-05 23:45:35,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:45:35,797 INFO  L218           NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:45:35,808 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-05 23:45:35,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:45:35,998 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:45:35,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:45:35,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -1720899328, now seen corresponding path program 1 times
[2025-02-05 23:45:36,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:45:36,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457293889]
[2025-02-05 23:45:36,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:36,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:45:36,010 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-02-05 23:45:36,096 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-02-05 23:45:36,099 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:36,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:39,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 3444 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked.
[2025-02-05 23:45:39,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:45:39,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457293889]
[2025-02-05 23:45:39,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457293889] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:45:39,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257002099]
[2025-02-05 23:45:39,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:45:39,432 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:45:39,432 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:45:39,434 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 23:45:39,436 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 23:45:39,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-02-05 23:45:39,539 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-02-05 23:45:39,539 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:45:39,539 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:45:39,542 INFO  L256         TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-02-05 23:45:39,549 INFO  L279         TraceCheckSpWp]: Computing forward predicates...