./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.4.prop3-func-interl.c --full-output --architecture 64bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fb7a49ed8e7ed557fbd1939c5f93a9f842df9357d78dfe245f08dc66947d1a5
[2025-01-09 07:43:37,648 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 07:43:37,655 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 07:43:37,657 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 07:43:37,658 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 07:43:37,658 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 07:43:37,660 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.4.prop3-func-interl.c
[2025-01-09 07:43:38,868 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70c7e9d03/d060ac340e37491b9eec101c23c45f48/FLAGc5ff63962
[2025-01-09 07:43:39,404 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 07:43:39,405 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.4.prop3-func-interl.c
[2025-01-09 07:43:39,444 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70c7e9d03/d060ac340e37491b9eec101c23c45f48/FLAGc5ff63962
[2025-01-09 07:43:39,945 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70c7e9d03/d060ac340e37491b9eec101c23c45f48
[2025-01-09 07:43:39,947 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 07:43:39,948 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 07:43:39,949 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 07:43:39,949 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 07:43:39,953 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 07:43:39,954 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:43:39" (1/1) ...
[2025-01-09 07:43:39,955 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b70786a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:39, skipping insertion in model container
[2025-01-09 07:43:39,955 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:43:39" (1/1) ...
[2025-01-09 07:43:40,037 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 07:43:40,273 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.4.prop3-func-interl.c[1174,1187]
[2025-01-09 07:43:40,933 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:43:40,940 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 07:43:40,947 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.4.prop3-func-interl.c[1174,1187]
[2025-01-09 07:43:41,451 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:43:41,464 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 07:43:41,465 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41 WrapperNode
[2025-01-09 07:43:41,465 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 07:43:41,466 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 07:43:41,467 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 07:43:41,467 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 07:43:41,471 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:41,595 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:43,487 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27010
[2025-01-09 07:43:43,487 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 07:43:43,488 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 07:43:43,488 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 07:43:43,488 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 07:43:43,495 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:43,495 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:44,047 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:44,469 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-01-09 07:43:44,469 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:44,469 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:45,117 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:45,318 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:45,537 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:45,764 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:45,911 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:46,413 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 07:43:46,414 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 07:43:46,414 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 07:43:46,414 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 07:43:46,416 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (1/1) ...
[2025-01-09 07:43:46,422 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:43:46,438 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 07:43:46,464 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-01-09 07:43:46,474 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-01-09 07:43:46,528 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 07:43:46,531 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 07:43:46,532 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 07:43:46,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 07:43:48,402 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 07:43:48,403 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 07:44:55,394 INFO  L?                        ?]: Removed 14591 outVars from TransFormulas that were not future-live.
[2025-01-09 07:44:55,395 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 07:44:55,498 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 07:44:55,498 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-09 07:44:55,498 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:55 BoogieIcfgContainer
[2025-01-09 07:44:55,499 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 07:44:55,500 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 07:44:55,501 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 07:44:55,504 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 07:44:55,504 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:43:39" (1/3) ...
[2025-01-09 07:44:55,506 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef49cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:55, skipping insertion in model container
[2025-01-09 07:44:55,506 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:43:41" (2/3) ...
[2025-01-09 07:44:55,506 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef49cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:55, skipping insertion in model container
[2025-01-09 07:44:55,506 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:55" (3/3) ...
[2025-01-09 07:44:55,507 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.needham.4.prop3-func-interl.c
[2025-01-09 07:44:55,518 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 07:44:55,519 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.needham.4.prop3-func-interl.c that has 1 procedures, 9842 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-01-09 07:44:55,678 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 07:44:55,688 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;@6e499183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 07:44:55,689 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-01-09 07:44:55,713 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 9842 states, 9840 states have (on average 1.5035569105691058) internal successors, (14795), 9841 states have internal predecessors, (14795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:55,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 400
[2025-01-09 07:44:55,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:44:55,742 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:44:55,743 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:44:55,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:44:55,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 360624852, now seen corresponding path program 1 times
[2025-01-09 07:44:55,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:44:55,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163241687]
[2025-01-09 07:44:55,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:44:55,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:44:55,930 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes.
[2025-01-09 07:44:56,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements.
[2025-01-09 07:44:56,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:44:56,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:44:57,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 07:44:57,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:44:57,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163241687]
[2025-01-09 07:44:57,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163241687] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:44:57,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:44:57,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:44:57,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237528225]
[2025-01-09 07:44:57,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:44:57,200 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:44:57,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:44:57,214 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:44:57,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:57,231 INFO  L87              Difference]: Start difference. First operand  has 9842 states, 9840 states have (on average 1.5035569105691058) internal successors, (14795), 9841 states have internal predecessors, (14795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:57,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:44:57,588 INFO  L93              Difference]: Finished difference Result 19405 states and 29175 transitions.
[2025-01-09 07:44:57,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:44:57,590 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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 399
[2025-01-09 07:44:57,593 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:44:57,641 INFO  L225             Difference]: With dead ends: 19405
[2025-01-09 07:44:57,641 INFO  L226             Difference]: Without dead ends: 9841
[2025-01-09 07:44:57,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:57,666 INFO  L435           NwaCegarLoop]: 14789 mSDtfsCounter, 0 mSDsluCounter, 29572 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44361 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:44:57,667 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44361 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:44:57,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9841 states.
[2025-01-09 07:44:57,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9841 to 9841.
[2025-01-09 07:44:57,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9841 states, 9840 states have (on average 1.5033536585365854) internal successors, (14793), 9840 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:57,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9841 states to 9841 states and 14793 transitions.
[2025-01-09 07:44:57,931 INFO  L78                 Accepts]: Start accepts. Automaton has 9841 states and 14793 transitions. Word has length 399
[2025-01-09 07:44:57,932 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:44:57,932 INFO  L471      AbstractCegarLoop]: Abstraction has 9841 states and 14793 transitions.
[2025-01-09 07:44:57,933 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:57,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 9841 states and 14793 transitions.
[2025-01-09 07:44:57,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 401
[2025-01-09 07:44:57,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:44:57,942 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:44:57,942 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 07:44:57,943 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:44:57,943 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:44:57,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -1703833762, now seen corresponding path program 1 times
[2025-01-09 07:44:57,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:44:57,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986789424]
[2025-01-09 07:44:57,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:44:57,944 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:44:58,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes.
[2025-01-09 07:44:58,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements.
[2025-01-09 07:44:58,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:44:58,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:44:58,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 07:44:58,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:44:58,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986789424]
[2025-01-09 07:44:58,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986789424] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:44:58,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:44:58,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:44:58,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764781485]
[2025-01-09 07:44:58,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:44:58,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:44:58,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:44:58,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:44:58,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:58,527 INFO  L87              Difference]: Start difference. First operand 9841 states and 14793 transitions. Second operand  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:58,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:44:58,723 INFO  L93              Difference]: Finished difference Result 19406 states and 29173 transitions.
[2025-01-09 07:44:58,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:44:58,723 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 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 400
[2025-01-09 07:44:58,724 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:44:58,750 INFO  L225             Difference]: With dead ends: 19406
[2025-01-09 07:44:58,750 INFO  L226             Difference]: Without dead ends: 9843
[2025-01-09 07:44:58,761 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:58,762 INFO  L435           NwaCegarLoop]: 14789 mSDtfsCounter, 0 mSDsluCounter, 29568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44357 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:44:58,763 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44357 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:44:58,777 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9843 states.
[2025-01-09 07:44:58,890 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9843.
[2025-01-09 07:44:58,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9843 states, 9842 states have (on average 1.5032513716724243) internal successors, (14795), 9842 states have internal predecessors, (14795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:58,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 14795 transitions.
[2025-01-09 07:44:58,925 INFO  L78                 Accepts]: Start accepts. Automaton has 9843 states and 14795 transitions. Word has length 400
[2025-01-09 07:44:58,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:44:58,926 INFO  L471      AbstractCegarLoop]: Abstraction has 9843 states and 14795 transitions.
[2025-01-09 07:44:58,926 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:58,926 INFO  L276                IsEmpty]: Start isEmpty. Operand 9843 states and 14795 transitions.
[2025-01-09 07:44:58,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 402
[2025-01-09 07:44:58,930 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:44:58,930 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:44:58,930 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 07:44:58,931 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:44:58,931 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:44:58,931 INFO  L85        PathProgramCache]: Analyzing trace with hash 1917764845, now seen corresponding path program 1 times
[2025-01-09 07:44:58,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:44:58,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872267186]
[2025-01-09 07:44:58,933 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:44:58,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:44:59,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes.
[2025-01-09 07:44:59,061 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements.
[2025-01-09 07:44:59,062 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:44:59,062 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:44:59,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 07:44:59,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:44:59,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872267186]
[2025-01-09 07:44:59,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872267186] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:44:59,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:44:59,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:44:59,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320359995]
[2025-01-09 07:44:59,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:44:59,511 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:44:59,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:44:59,512 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:44:59,512 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:59,512 INFO  L87              Difference]: Start difference. First operand 9843 states and 14795 transitions. Second operand  has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:59,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:44:59,715 INFO  L93              Difference]: Finished difference Result 19410 states and 29177 transitions.
[2025-01-09 07:44:59,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:44:59,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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 401
[2025-01-09 07:44:59,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:44:59,752 INFO  L225             Difference]: With dead ends: 19410
[2025-01-09 07:44:59,753 INFO  L226             Difference]: Without dead ends: 9845
[2025-01-09 07:44:59,764 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:44:59,764 INFO  L435           NwaCegarLoop]: 14789 mSDtfsCounter, 0 mSDsluCounter, 29562 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44351 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:44:59,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44351 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:44:59,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9845 states.
[2025-01-09 07:44:59,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 9845.
[2025-01-09 07:44:59,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9845 states, 9844 states have (on average 1.5031491263713936) internal successors, (14797), 9844 states have internal predecessors, (14797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:59,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 14797 transitions.
[2025-01-09 07:44:59,917 INFO  L78                 Accepts]: Start accepts. Automaton has 9845 states and 14797 transitions. Word has length 401
[2025-01-09 07:44:59,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:44:59,919 INFO  L471      AbstractCegarLoop]: Abstraction has 9845 states and 14797 transitions.
[2025-01-09 07:44:59,920 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:44:59,920 INFO  L276                IsEmpty]: Start isEmpty. Operand 9845 states and 14797 transitions.
[2025-01-09 07:44:59,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 403
[2025-01-09 07:44:59,923 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:44:59,923 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:44:59,924 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 07:44:59,924 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:44:59,925 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:44:59,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 230057413, now seen corresponding path program 1 times
[2025-01-09 07:44:59,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:44:59,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56345347]
[2025-01-09 07:44:59,926 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:44:59,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:45:00,013 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes.
[2025-01-09 07:45:00,091 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements.
[2025-01-09 07:45:00,091 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:45:00,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:45:00,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 07:45:00,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:45:00,670 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56345347]
[2025-01-09 07:45:00,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56345347] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:45:00,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:45:00,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 07:45:00,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662427491]
[2025-01-09 07:45:00,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:45:00,671 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 07:45:00,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:45:00,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 07:45:00,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 07:45:00,672 INFO  L87              Difference]: Start difference. First operand 9845 states and 14797 transitions. Second operand  has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:45:07,773 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:45:07,773 INFO  L93              Difference]: Finished difference Result 28965 states and 43539 transitions.
[2025-01-09 07:45:07,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 07:45:07,774 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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 402
[2025-01-09 07:45:07,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:45:07,826 INFO  L225             Difference]: With dead ends: 28965
[2025-01-09 07:45:07,830 INFO  L226             Difference]: Without dead ends: 19398
[2025-01-09 07:45:07,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-01-09 07:45:07,861 INFO  L435           NwaCegarLoop]: 11655 mSDtfsCounter, 14381 mSDsluCounter, 34745 mSDsCounter, 0 mSdLazyCounter, 12349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14381 SdHoareTripleChecker+Valid, 46400 SdHoareTripleChecker+Invalid, 12350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time
[2025-01-09 07:45:07,861 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14381 Valid, 46400 Invalid, 12350 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 12349 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time]
[2025-01-09 07:45:07,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19398 states.
[2025-01-09 07:45:08,005 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 10348.
[2025-01-09 07:45:08,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10348 states, 10347 states have (on average 1.5028510679423988) internal successors, (15550), 10347 states have internal predecessors, (15550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:45:08,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 15550 transitions.
[2025-01-09 07:45:08,024 INFO  L78                 Accepts]: Start accepts. Automaton has 10348 states and 15550 transitions. Word has length 402
[2025-01-09 07:45:08,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:45:08,024 INFO  L471      AbstractCegarLoop]: Abstraction has 10348 states and 15550 transitions.
[2025-01-09 07:45:08,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:45:08,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 10348 states and 15550 transitions.
[2025-01-09 07:45:08,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 404
[2025-01-09 07:45:08,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:45:08,029 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:45:08,029 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 07:45:08,029 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:45:08,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:45:08,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -1138805942, now seen corresponding path program 1 times
[2025-01-09 07:45:08,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:45:08,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486851872]
[2025-01-09 07:45:08,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:45:08,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:45:08,099 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-01-09 07:45:08,139 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-01-09 07:45:08,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:45:08,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:45:08,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 07:45:08,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:45:08,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486851872]
[2025-01-09 07:45:08,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486851872] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:45:08,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:45:08,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-01-09 07:45:08,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336846744]
[2025-01-09 07:45:08,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:45:08,890 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-01-09 07:45:08,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:45:08,891 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-01-09 07:45:08,891 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-01-09 07:45:08,891 INFO  L87              Difference]: Start difference. First operand 10348 states and 15550 transitions. Second operand  has 7 states, 7 states have (on average 57.57142857142857) internal successors, (403), 7 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-09 07:45:09,173 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:45:09,174 INFO  L93              Difference]: Finished difference Result 20802 states and 31281 transitions.
[2025-01-09 07:45:09,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-01-09 07:45:09,175 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 57.57142857142857) internal successors, (403), 7 states have internal predecessors, (403), 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 403
[2025-01-09 07:45:09,175 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:45:09,188 INFO  L225             Difference]: With dead ends: 20802
[2025-01-09 07:45:09,188 INFO  L226             Difference]: Without dead ends: 11235
[2025-01-09 07:45:09,198 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-01-09 07:45:09,200 INFO  L435           NwaCegarLoop]: 14785 mSDtfsCounter, 2129 mSDsluCounter, 73474 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 88259 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 07:45:09,200 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 88259 Invalid, 74 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 07:45:09,212 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11235 states.
[2025-01-09 07:45:09,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10349.