./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.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 31ed4c1d4c56093916e3e6078a050f9b467d4295a9560366c0e4e3c015413196
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-12 04:50:46,083 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-12 04:50:46,137 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-12 04:50:46,141 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-12 04:50:46,144 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-12 04:50:46,171 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-12 04:50:46,173 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-12 04:50:46,173 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-12 04:50:46,174 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-12 04:50:46,175 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-12 04:50:46,176 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-12 04:50:46,176 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-12 04:50:46,177 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-12 04:50:46,180 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-12 04:50:46,180 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-12 04:50:46,181 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-12 04:50:46,181 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-12 04:50:46,181 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-12 04:50:46,181 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-12 04:50:46,181 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-12 04:50:46,182 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-12 04:50:46,183 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-12 04:50:46,183 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-12 04:50:46,183 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-12 04:50:46,183 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-12 04:50:46,183 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-12 04:50:46,184 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-12 04:50:46,184 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-12 04:50:46,184 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-12 04:50:46,184 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-12 04:50:46,184 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-12 04:50:46,185 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-12 04:50:46,185 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 04:50:46,185 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-12 04:50:46,186 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-12 04:50:46,186 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-12 04:50:46,187 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-12 04:50:46,187 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-12 04:50:46,187 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-12 04:50:46,187 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-12 04:50:46,187 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-12 04:50:46,188 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-12 04:50:46,188 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 31ed4c1d4c56093916e3e6078a050f9b467d4295a9560366c0e4e3c015413196
[2024-11-12 04:50:46,414 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-12 04:50:46,461 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-12 04:50:46,463 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-12 04:50:46,464 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-12 04:50:46,465 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-12 04:50:46,465 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i
[2024-11-12 04:50:47,880 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-12 04:50:48,061 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-12 04:50:48,062 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i
[2024-11-12 04:50:48,070 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4339084de/176b51a2d18147a8babbbbd0bb092f9b/FLAGfb5cd35af
[2024-11-12 04:50:48,085 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4339084de/176b51a2d18147a8babbbbd0bb092f9b
[2024-11-12 04:50:48,087 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-12 04:50:48,089 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-12 04:50:48,089 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-12 04:50:48,090 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-12 04:50:48,094 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-12 04:50:48,094 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,095 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7141c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48, skipping insertion in model container
[2024-11-12 04:50:48,095 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,117 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-12 04:50:48,267 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i[916,929]
[2024-11-12 04:50:48,297 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 04:50:48,312 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-12 04:50:48,321 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-63.i[916,929]
[2024-11-12 04:50:48,336 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-12 04:50:48,352 INFO  L204         MainTranslator]: Completed translation
[2024-11-12 04:50:48,352 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48 WrapperNode
[2024-11-12 04:50:48,353 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-12 04:50:48,353 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-12 04:50:48,354 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-12 04:50:48,354 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-12 04:50:48,359 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,366 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,397 INFO  L138                Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130
[2024-11-12 04:50:48,398 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-12 04:50:48,398 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-12 04:50:48,398 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-12 04:50:48,398 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-12 04:50:48,427 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,427 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,431 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,455 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].
[2024-11-12 04:50:48,455 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,455 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,463 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,465 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,467 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,468 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,472 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-12 04:50:48,472 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-12 04:50:48,473 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-12 04:50:48,473 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-12 04:50:48,474 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (1/1) ...
[2024-11-12 04:50:48,495 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-12 04:50:48,512 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 04:50:48,537 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)
[2024-11-12 04:50:48,543 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
[2024-11-12 04:50:48,581 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-12 04:50:48,581 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-12 04:50:48,582 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-12 04:50:48,582 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-12 04:50:48,582 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-12 04:50:48,582 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-12 04:50:48,651 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-12 04:50:48,652 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-12 04:50:48,878 INFO  L?                        ?]: Removed 10 outVars from TransFormulas that were not future-live.
[2024-11-12 04:50:48,878 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-12 04:50:48,892 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-12 04:50:48,892 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-12 04:50:48,892 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:50:48 BoogieIcfgContainer
[2024-11-12 04:50:48,892 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-12 04:50:48,894 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-12 04:50:48,894 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-12 04:50:48,897 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-12 04:50:48,897 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:50:48" (1/3) ...
[2024-11-12 04:50:48,898 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105eb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:50:48, skipping insertion in model container
[2024-11-12 04:50:48,898 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:50:48" (2/3) ...
[2024-11-12 04:50:48,898 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105eb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:50:48, skipping insertion in model container
[2024-11-12 04:50:48,898 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:50:48" (3/3) ...
[2024-11-12 04:50:48,899 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-63.i
[2024-11-12 04:50:48,912 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-12 04:50:48,912 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-12 04:50:48,960 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-12 04:50:48,966 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;@401b8889, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-12 04:50:48,966 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-12 04:50:48,970 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 56 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-12 04:50:48,979 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-12 04:50:48,979 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-12 04:50:48,980 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 04:50:48,980 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-12 04:50:48,985 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 04:50:48,985 INFO  L85        PathProgramCache]: Analyzing trace with hash 83983945, now seen corresponding path program 1 times
[2024-11-12 04:50:48,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 04:50:48,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997252087]
[2024-11-12 04:50:48,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 04:50:48,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 04:50:49,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,226 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-12 04:50:49,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,237 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-12 04:50:49,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,244 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-12 04:50:49,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,252 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-12 04:50:49,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,264 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-12 04:50:49,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,271 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-12 04:50:49,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,274 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 04:50:49,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,281 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-12 04:50:49,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,291 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-12 04:50:49,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,298 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-12 04:50:49,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,303 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-12 04:50:49,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,306 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-12 04:50:49,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,310 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-12 04:50:49,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,313 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-12 04:50:49,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,319 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-12 04:50:49,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,327 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-12 04:50:49,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,330 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-12 04:50:49,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,336 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-12 04:50:49,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,340 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-12 04:50:49,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,346 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-12 04:50:49,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,355 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-12 04:50:49,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,362 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-12 04:50:49,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-12 04:50:49,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 04:50:49,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997252087]
[2024-11-12 04:50:49,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997252087] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 04:50:49,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 04:50:49,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-12 04:50:49,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702480397]
[2024-11-12 04:50:49,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 04:50:49,379 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-12 04:50:49,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 04:50:49,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-12 04:50:49,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-12 04:50:49,399 INFO  L87              Difference]: Start difference. First operand  has 56 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand  has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:49,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 04:50:49,419 INFO  L93              Difference]: Finished difference Result 105 states and 182 transitions.
[2024-11-12 04:50:49,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-12 04:50:49,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134
[2024-11-12 04:50:49,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 04:50:49,428 INFO  L225             Difference]: With dead ends: 105
[2024-11-12 04:50:49,429 INFO  L226             Difference]: Without dead ends: 52
[2024-11-12 04:50:49,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-12 04:50:49,437 INFO  L435           NwaCegarLoop]: 76 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, 76 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
[2024-11-12 04:50:49,438 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-12 04:50:49,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-11-12 04:50:49,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2024-11-12 04:50:49,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 52 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-12 04:50:49,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions.
[2024-11-12 04:50:49,471 INFO  L78                 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 134
[2024-11-12 04:50:49,471 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-12 04:50:49,471 INFO  L471      AbstractCegarLoop]: Abstraction has 52 states and 76 transitions.
[2024-11-12 04:50:49,472 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:49,472 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions.
[2024-11-12 04:50:49,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-12 04:50:49,474 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-12 04:50:49,474 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 04:50:49,475 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-12 04:50:49,475 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-12 04:50:49,475 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 04:50:49,476 INFO  L85        PathProgramCache]: Analyzing trace with hash -459924215, now seen corresponding path program 1 times
[2024-11-12 04:50:49,476 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 04:50:49,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482303099]
[2024-11-12 04:50:49,476 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 04:50:49,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 04:50:49,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,904 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-12 04:50:49,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,913 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-12 04:50:49,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,917 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-12 04:50:49,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,920 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-12 04:50:49,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,923 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-12 04:50:49,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,926 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-12 04:50:49,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,930 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 04:50:49,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,938 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-12 04:50:49,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,946 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-12 04:50:49,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,952 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-12 04:50:49,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,958 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-12 04:50:49,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,963 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-12 04:50:49,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,971 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-12 04:50:49,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,976 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-12 04:50:49,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,980 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-12 04:50:49,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,986 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-12 04:50:49,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,991 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-12 04:50:49,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:49,994 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-12 04:50:49,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:50,001 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-12 04:50:50,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:50,008 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-12 04:50:50,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:50,013 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-12 04:50:50,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:50,016 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-12 04:50:50,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:50,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-12 04:50:50,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 04:50:50,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482303099]
[2024-11-12 04:50:50,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482303099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 04:50:50,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 04:50:50,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-12 04:50:50,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137637004]
[2024-11-12 04:50:50,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 04:50:50,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-12 04:50:50,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 04:50:50,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-12 04:50:50,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-12 04:50:50,024 INFO  L87              Difference]: Start difference. First operand 52 states and 76 transitions. Second operand  has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:50,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 04:50:50,304 INFO  L93              Difference]: Finished difference Result 105 states and 152 transitions.
[2024-11-12 04:50:50,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-12 04:50:50,305 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134
[2024-11-12 04:50:50,306 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 04:50:50,308 INFO  L225             Difference]: With dead ends: 105
[2024-11-12 04:50:50,308 INFO  L226             Difference]: Without dead ends: 56
[2024-11-12 04:50:50,308 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-12 04:50:50,310 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-12 04:50:50,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 104 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-12 04:50:50,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2024-11-12 04:50:50,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2024-11-12 04:50:50,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2024-11-12 04:50:50,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions.
[2024-11-12 04:50:50,333 INFO  L78                 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 134
[2024-11-12 04:50:50,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-12 04:50:50,334 INFO  L471      AbstractCegarLoop]: Abstraction has 56 states and 78 transitions.
[2024-11-12 04:50:50,335 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:50,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions.
[2024-11-12 04:50:50,337 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-12 04:50:50,337 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-12 04:50:50,337 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 04:50:50,337 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-12 04:50:50,338 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-12 04:50:50,338 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 04:50:50,338 INFO  L85        PathProgramCache]: Analyzing trace with hash -402665913, now seen corresponding path program 1 times
[2024-11-12 04:50:50,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 04:50:50,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239444091]
[2024-11-12 04:50:50,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 04:50:50,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 04:50:50,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,923 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-12 04:50:56,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,928 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-12 04:50:56,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,931 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-12 04:50:56,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,933 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-12 04:50:56,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,935 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-12 04:50:56,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,937 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-12 04:50:56,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,939 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 04:50:56,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,941 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-12 04:50:56,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,943 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-12 04:50:56,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,945 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-12 04:50:56,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,947 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-12 04:50:56,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,949 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-12 04:50:56,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,951 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-12 04:50:56,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,953 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-12 04:50:56,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,955 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-12 04:50:56,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,957 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-12 04:50:56,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,959 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-12 04:50:56,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,962 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-12 04:50:56,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,964 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-12 04:50:56,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,966 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-12 04:50:56,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,968 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-12 04:50:56,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,970 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-12 04:50:56,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:50:56,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2024-11-12 04:50:56,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 04:50:56,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239444091]
[2024-11-12 04:50:56,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239444091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-12 04:50:56,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-12 04:50:56,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-12 04:50:56,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725023904]
[2024-11-12 04:50:56,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-12 04:50:56,974 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-12 04:50:56,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-12 04:50:56,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-12 04:50:56,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-12 04:50:56,975 INFO  L87              Difference]: Start difference. First operand 56 states and 78 transitions. Second operand  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:58,185 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-12 04:50:58,185 INFO  L93              Difference]: Finished difference Result 108 states and 146 transitions.
[2024-11-12 04:50:58,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-12 04:50:58,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134
[2024-11-12 04:50:58,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-12 04:50:58,192 INFO  L225             Difference]: With dead ends: 108
[2024-11-12 04:50:58,192 INFO  L226             Difference]: Without dead ends: 106
[2024-11-12 04:50:58,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272
[2024-11-12 04:50:58,194 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 134 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-12 04:50:58,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 344 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-12 04:50:58,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2024-11-12 04:50:58,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89.
[2024-11-12 04:50:58,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 50 states have (on average 1.08) internal successors, (54), 51 states have internal predecessors, (54), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34)
[2024-11-12 04:50:58,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions.
[2024-11-12 04:50:58,232 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 134
[2024-11-12 04:50:58,233 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-12 04:50:58,233 INFO  L471      AbstractCegarLoop]: Abstraction has 89 states and 122 transitions.
[2024-11-12 04:50:58,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2024-11-12 04:50:58,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions.
[2024-11-12 04:50:58,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-12 04:50:58,237 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-12 04:50:58,237 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-12 04:50:58,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-12 04:50:58,237 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-12 04:50:58,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-12 04:50:58,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212012539, now seen corresponding path program 1 times
[2024-11-12 04:50:58,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-12 04:50:58,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169048825]
[2024-11-12 04:50:58,238 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 04:50:58,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-12 04:50:58,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,444 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-12 04:51:02,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,448 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-12 04:51:02,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,450 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-12 04:51:02,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,452 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-12 04:51:02,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,454 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-12 04:51:02,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,456 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-12 04:51:02,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,458 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-12 04:51:02,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,460 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-12 04:51:02,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,493 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-12 04:51:02,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,497 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-12 04:51:02,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,499 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-12 04:51:02,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-12 04:51:02,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,505 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-12 04:51:02,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,507 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-12 04:51:02,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,510 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-12 04:51:02,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,513 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87
[2024-11-12 04:51:02,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,515 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-12 04:51:02,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,518 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98
[2024-11-12 04:51:02,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,520 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-12 04:51:02,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,523 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109
[2024-11-12 04:51:02,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,526 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-12 04:51:02,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,528 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120
[2024-11-12 04:51:02,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked.
[2024-11-12 04:51:02,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-12 04:51:02,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169048825]
[2024-11-12 04:51:02,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169048825] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-12 04:51:02,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556582519]
[2024-11-12 04:51:02,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-12 04:51:02,532 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-12 04:51:02,533 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-12 04:51:02,535 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)
[2024-11-12 04:51:02,536 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-12 04:51:02,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-12 04:51:02,617 INFO  L256         TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-12 04:51:02,635 INFO  L279         TraceCheckSpWp]: Computing forward predicates...