./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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/forester-heap/sll-optional-1.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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 17:38:49,243 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 17:38:49,294 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-16 17:38:49,298 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 17:38:49,298 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 17:38:49,313 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 17:38:49,314 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 17:38:49,314 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 17:38:49,314 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 17:38:49,315 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 17:38:49,315 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 17:38:49,315 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 17:38:49,316 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 17:38:49,316 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 17:38:49,316 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 17:38:49,316 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 17:38:49,317 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 17:38:49,317 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 17:38:49,317 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0
[2025-03-16 17:38:49,528 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 17:38:49,535 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 17:38:49,536 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 17:38:49,537 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 17:38:49,537 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 17:38:49,538 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i
[2025-03-16 17:38:50,654 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85595d92/94fcefd336fd45debd33df32dfd81f04/FLAG74cdff846
[2025-03-16 17:38:50,949 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 17:38:50,949 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i
[2025-03-16 17:38:50,964 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85595d92/94fcefd336fd45debd33df32dfd81f04/FLAG74cdff846
[2025-03-16 17:38:51,219 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85595d92/94fcefd336fd45debd33df32dfd81f04
[2025-03-16 17:38:51,221 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 17:38:51,222 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 17:38:51,223 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 17:38:51,223 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 17:38:51,226 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 17:38:51,226 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,227 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117fad5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51, skipping insertion in model container
[2025-03-16 17:38:51,227 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,252 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 17:38:51,442 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/forester-heap/sll-optional-1.i[22688,22701]
[2025-03-16 17:38:51,448 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 17:38:51,454 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 17:38:51,476 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/forester-heap/sll-optional-1.i[22688,22701]
[2025-03-16 17:38:51,478 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 17:38:51,495 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 17:38:51,495 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51 WrapperNode
[2025-03-16 17:38:51,495 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 17:38:51,496 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 17:38:51,496 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 17:38:51,496 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 17:38:51,501 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,508 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,520 INFO  L138                Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125
[2025-03-16 17:38:51,521 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 17:38:51,521 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 17:38:51,521 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 17:38:51,521 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 17:38:51,529 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,529 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,531 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,542 INFO  L175           MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17].
[2025-03-16 17:38:51,542 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,543 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,548 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,549 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,550 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,551 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,553 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 17:38:51,554 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 17:38:51,554 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 17:38:51,554 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 17:38:51,555 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (1/1) ...
[2025-03-16 17:38:51,559 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 17:38:51,568 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:38:51,579 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-16 17:38:51,580 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-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-16 17:38:51,597 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 17:38:51,597 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 17:38:51,678 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 17:38:51,680 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 17:38:51,846 INFO  L?                        ?]: Removed 19 outVars from TransFormulas that were not future-live.
[2025-03-16 17:38:51,846 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 17:38:51,855 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 17:38:51,856 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 17:38:51,856 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:51 BoogieIcfgContainer
[2025-03-16 17:38:51,856 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 17:38:51,859 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 17:38:51,859 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 17:38:51,863 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 17:38:51,863 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:38:51" (1/3) ...
[2025-03-16 17:38:51,863 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd363bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:51, skipping insertion in model container
[2025-03-16 17:38:51,863 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:38:51" (2/3) ...
[2025-03-16 17:38:51,864 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd363bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:38:51, skipping insertion in model container
[2025-03-16 17:38:51,864 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:38:51" (3/3) ...
[2025-03-16 17:38:51,864 INFO  L128   eAbstractionObserver]: Analyzing ICFG sll-optional-1.i
[2025-03-16 17:38:51,875 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 17:38:51,876 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG sll-optional-1.i that has 1 procedures, 26 locations, 1 initial locations, 4 loop locations, and 1 error locations.
[2025-03-16 17:38:51,914 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 17:38:51,923 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;@200923bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 17:38:51,924 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 17:38:51,927 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:51,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2025-03-16 17:38:51,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:51,931 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:51,931 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:51,934 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:51,935 INFO  L85        PathProgramCache]: Analyzing trace with hash -841970188, now seen corresponding path program 1 times
[2025-03-16 17:38:51,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:51,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859904991]
[2025-03-16 17:38:51,942 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:51,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:52,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes.
[2025-03-16 17:38:52,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements.
[2025-03-16 17:38:52,026 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:52,026 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:52,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:52,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:52,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859904991]
[2025-03-16 17:38:52,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859904991] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:38:52,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:38:52,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-16 17:38:52,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298952628]
[2025-03-16 17:38:52,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:38:52,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-16 17:38:52,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:38:52,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-16 17:38:52,094 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-16 17:38:52,095 INFO  L87              Difference]: Start difference. First operand  has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:52,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:38:52,103 INFO  L93              Difference]: Finished difference Result 44 states and 66 transitions.
[2025-03-16 17:38:52,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-16 17:38:52,105 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2025-03-16 17:38:52,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:38:52,110 INFO  L225             Difference]: With dead ends: 44
[2025-03-16 17:38:52,111 INFO  L226             Difference]: Without dead ends: 21
[2025-03-16 17:38:52,113 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 17:38:52,114 INFO  L435           NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 17:38:52,115 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 17:38:52,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-03-16 17:38:52,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2025-03-16 17:38:52,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:52,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions.
[2025-03-16 17:38:52,135 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 14
[2025-03-16 17:38:52,135 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:38:52,135 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 29 transitions.
[2025-03-16 17:38:52,135 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:52,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions.
[2025-03-16 17:38:52,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-16 17:38:52,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:52,135 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:52,136 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 17:38:52,136 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:52,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:52,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 465832892, now seen corresponding path program 1 times
[2025-03-16 17:38:52,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:52,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326041823]
[2025-03-16 17:38:52,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:52,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:52,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-16 17:38:52,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-16 17:38:52,189 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:52,189 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:52,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:52,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:52,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326041823]
[2025-03-16 17:38:52,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326041823] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:38:52,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:38:52,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 17:38:52,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358128077]
[2025-03-16 17:38:52,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:38:52,790 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 17:38:52,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:38:52,791 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 17:38:52,791 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-16 17:38:52,791 INFO  L87              Difference]: Start difference. First operand 21 states and 29 transitions. Second operand  has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:38:53,023 INFO  L93              Difference]: Finished difference Result 64 states and 84 transitions.
[2025-03-16 17:38:53,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 17:38:53,024 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2025-03-16 17:38:53,024 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:38:53,025 INFO  L225             Difference]: With dead ends: 64
[2025-03-16 17:38:53,025 INFO  L226             Difference]: Without dead ends: 52
[2025-03-16 17:38:53,025 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2025-03-16 17:38:53,026 INFO  L435           NwaCegarLoop]: 13 mSDtfsCounter, 97 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 17:38:53,026 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 66 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 17:38:53,028 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2025-03-16 17:38:53,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35.
[2025-03-16 17:38:53,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions.
[2025-03-16 17:38:53,035 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 15
[2025-03-16 17:38:53,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:38:53,035 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 47 transitions.
[2025-03-16 17:38:53,035 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,035 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions.
[2025-03-16 17:38:53,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-16 17:38:53,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:53,036 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:53,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 17:38:53,036 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:53,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:53,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 466756413, now seen corresponding path program 1 times
[2025-03-16 17:38:53,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:53,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086663751]
[2025-03-16 17:38:53,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:53,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:53,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-16 17:38:53,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-16 17:38:53,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:53,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:53,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:53,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:53,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086663751]
[2025-03-16 17:38:53,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086663751] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:38:53,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:38:53,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 17:38:53,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423885769]
[2025-03-16 17:38:53,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:38:53,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 17:38:53,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:38:53,163 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 17:38:53,163 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-16 17:38:53,164 INFO  L87              Difference]: Start difference. First operand 35 states and 47 transitions. Second operand  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:38:53,269 INFO  L93              Difference]: Finished difference Result 53 states and 71 transitions.
[2025-03-16 17:38:53,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 17:38:53,270 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2025-03-16 17:38:53,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:38:53,270 INFO  L225             Difference]: With dead ends: 53
[2025-03-16 17:38:53,271 INFO  L226             Difference]: Without dead ends: 51
[2025-03-16 17:38:53,271 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-16 17:38:53,272 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 17:38:53,273 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 17:38:53,273 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-03-16 17:38:53,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39.
[2025-03-16 17:38:53,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions.
[2025-03-16 17:38:53,281 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 15
[2025-03-16 17:38:53,281 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:38:53,281 INFO  L471      AbstractCegarLoop]: Abstraction has 39 states and 53 transitions.
[2025-03-16 17:38:53,281 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions.
[2025-03-16 17:38:53,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-16 17:38:53,282 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:53,282 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:53,282 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 17:38:53,283 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:53,283 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:53,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354260094, now seen corresponding path program 1 times
[2025-03-16 17:38:53,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:53,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919310129]
[2025-03-16 17:38:53,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:53,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:53,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-16 17:38:53,303 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-16 17:38:53,304 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:53,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:53,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:53,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:53,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919310129]
[2025-03-16 17:38:53,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919310129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:38:53,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:38:53,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 17:38:53,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11722735]
[2025-03-16 17:38:53,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:38:53,393 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 17:38:53,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:38:53,393 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 17:38:53,393 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 17:38:53,394 INFO  L87              Difference]: Start difference. First operand 39 states and 53 transitions. Second operand  has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:38:53,511 INFO  L93              Difference]: Finished difference Result 80 states and 105 transitions.
[2025-03-16 17:38:53,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 17:38:53,512 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2025-03-16 17:38:53,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:38:53,513 INFO  L225             Difference]: With dead ends: 80
[2025-03-16 17:38:53,513 INFO  L226             Difference]: Without dead ends: 59
[2025-03-16 17:38:53,513 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-16 17:38:53,513 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 17:38:53,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 71 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 17:38:53,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-03-16 17:38:53,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37.
[2025-03-16 17:38:53,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions.
[2025-03-16 17:38:53,518 INFO  L78                 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 15
[2025-03-16 17:38:53,518 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:38:53,518 INFO  L471      AbstractCegarLoop]: Abstraction has 37 states and 49 transitions.
[2025-03-16 17:38:53,518 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions.
[2025-03-16 17:38:53,518 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-03-16 17:38:53,518 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:53,518 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:53,518 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 17:38:53,518 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:53,519 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:53,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 1370035732, now seen corresponding path program 1 times
[2025-03-16 17:38:53,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:53,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186154109]
[2025-03-16 17:38:53,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:53,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:53,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-03-16 17:38:53,529 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-03-16 17:38:53,529 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:53,529 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:53,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:53,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:53,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186154109]
[2025-03-16 17:38:53,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186154109] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 17:38:53,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 17:38:53,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 17:38:53,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164226242]
[2025-03-16 17:38:53,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 17:38:53,653 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 17:38:53,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 17:38:53,653 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 17:38:53,653 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 17:38:53,653 INFO  L87              Difference]: Start difference. First operand 37 states and 49 transitions. Second operand  has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,765 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 17:38:53,765 INFO  L93              Difference]: Finished difference Result 79 states and 103 transitions.
[2025-03-16 17:38:53,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-16 17:38:53,765 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16
[2025-03-16 17:38:53,765 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 17:38:53,766 INFO  L225             Difference]: With dead ends: 79
[2025-03-16 17:38:53,766 INFO  L226             Difference]: Without dead ends: 77
[2025-03-16 17:38:53,766 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-16 17:38:53,766 INFO  L435           NwaCegarLoop]: 37 mSDtfsCounter, 39 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 17:38:53,766 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 17:38:53,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-03-16 17:38:53,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45.
[2025-03-16 17:38:53,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions.
[2025-03-16 17:38:53,777 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16
[2025-03-16 17:38:53,777 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 17:38:53,777 INFO  L471      AbstractCegarLoop]: Abstraction has 45 states and 60 transitions.
[2025-03-16 17:38:53,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 17:38:53,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions.
[2025-03-16 17:38:53,778 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-03-16 17:38:53,778 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 17:38:53,778 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 17:38:53,779 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 17:38:53,779 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 17:38:53,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 17:38:53,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -1612242230, now seen corresponding path program 1 times
[2025-03-16 17:38:53,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 17:38:53,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929018922]
[2025-03-16 17:38:53,780 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:53,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 17:38:53,794 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-16 17:38:53,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-16 17:38:53,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:53,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:54,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:54,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 17:38:54,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929018922]
[2025-03-16 17:38:54,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929018922] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-16 17:38:54,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998521472]
[2025-03-16 17:38:54,622 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 17:38:54,622 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-16 17:38:54,622 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 17:38:54,624 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-16 17:38:54,625 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-16 17:38:54,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-16 17:38:54,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-16 17:38:54,727 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 17:38:54,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 17:38:54,737 INFO  L256         TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 74 conjuncts are in the unsatisfiable core
[2025-03-16 17:38:54,748 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-16 17:38:54,778 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2025-03-16 17:38:54,817 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19
[2025-03-16 17:38:54,827 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11
[2025-03-16 17:38:54,849 INFO  L349             Elim1Store]: treesize reduction 32, result has 30.4 percent of original size
[2025-03-16 17:38:54,850 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 20
[2025-03-16 17:38:54,979 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2025-03-16 17:38:54,980 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2025-03-16 17:38:54,997 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,012 INFO  L349             Elim1Store]: treesize reduction 43, result has 14.0 percent of original size
[2025-03-16 17:38:55,012 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 46
[2025-03-16 17:38:55,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,037 INFO  L349             Elim1Store]: treesize reduction 29, result has 27.5 percent of original size
[2025-03-16 17:38:55,038 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 32
[2025-03-16 17:38:55,162 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,168 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,207 INFO  L349             Elim1Store]: treesize reduction 108, result has 21.2 percent of original size
[2025-03-16 17:38:55,207 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 261 treesize of output 162
[2025-03-16 17:38:55,229 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,230 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,243 INFO  L349             Elim1Store]: treesize reduction 61, result has 15.3 percent of original size
[2025-03-16 17:38:55,243 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 65
[2025-03-16 17:38:55,265 INFO  L349             Elim1Store]: treesize reduction 8, result has 78.4 percent of original size
[2025-03-16 17:38:55,265 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38
[2025-03-16 17:38:55,783 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2025-03-16 17:38:55,796 INFO  L349             Elim1Store]: treesize reduction 68, result has 1.4 percent of original size
[2025-03-16 17:38:55,797 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 130 treesize of output 63
[2025-03-16 17:38:55,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 17:38:55,916 INFO  L312         TraceCheckSpWp]: Computing backward predicates...