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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:11:50,867 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:11:50,920 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 16:11:50,927 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:11:50,929 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:11:50,951 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:11:50,953 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:11:50,953 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:11:50,953 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:11:50,953 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:11:50,954 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:11:50,954 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:11:50,954 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:11:50,954 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:11:50,955 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:11:50,955 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:11:50,956 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:11:50,956 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:11:50,956 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:11:50,957 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:11:50,958 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:11:50,958 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20
[2025-03-08 16:11:51,185 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:11:51,190 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:11:51,194 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:11:51,194 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:11:51,195 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:11:51,195 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:11:52,283 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d37343ba/b66dc16102884d029f8f2ee7100cc842/FLAG3625f25ae
[2025-03-08 16:11:52,550 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:11:52,572 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:11:52,592 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d37343ba/b66dc16102884d029f8f2ee7100cc842/FLAG3625f25ae
[2025-03-08 16:11:52,866 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d37343ba/b66dc16102884d029f8f2ee7100cc842
[2025-03-08 16:11:52,867 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:11:52,868 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:11:52,869 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:11:52,869 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:11:52,872 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:11:52,873 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:11:52" (1/1) ...
[2025-03-08 16:11:52,873 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a407b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:52, skipping insertion in model container
[2025-03-08 16:11:52,873 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:11:52" (1/1) ...
[2025-03-08 16:11:52,884 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:11:52,985 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_variablewrapping_normal_file-92.i[913,926]
[2025-03-08 16:11:53,029 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:11:53,041 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:11:53,048 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_variablewrapping_normal_file-92.i[913,926]
[2025-03-08 16:11:53,068 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:11:53,085 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:11:53,086 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53 WrapperNode
[2025-03-08 16:11:53,087 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:11:53,088 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:11:53,088 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:11:53,088 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:11:53,093 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,100 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,125 INFO  L138                Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136
[2025-03-08 16:11:53,129 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:11:53,129 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:11:53,133 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:11:53,134 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:11:53,140 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,141 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,142 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,162 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 16:11:53,163 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,163 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,168 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,173 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,174 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,175 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,176 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:11:53,177 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:11:53,177 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:11:53,177 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:11:53,178 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (1/1) ...
[2025-03-08 16:11:53,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:11:53,191 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:11:53,202 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:11:53,205 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:11:53,222 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:11:53,222 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:11:53,222 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:11:53,222 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 16:11:53,222 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:11:53,222 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:11:53,283 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:11:53,285 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:11:53,478 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise15#1;havoc property_#t~short16#1;
[2025-03-08 16:11:53,500 INFO  L?                        ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2025-03-08 16:11:53,501 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:11:53,517 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:11:53,518 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:11:53,522 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:11:53 BoogieIcfgContainer
[2025-03-08 16:11:53,522 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:11:53,524 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:11:53,524 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:11:53,527 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:11:53,528 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:11:52" (1/3) ...
[2025-03-08 16:11:53,528 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a6feec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:11:53, skipping insertion in model container
[2025-03-08 16:11:53,529 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:11:53" (2/3) ...
[2025-03-08 16:11:53,529 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a6feec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:11:53, skipping insertion in model container
[2025-03-08 16:11:53,529 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:11:53" (3/3) ...
[2025-03-08 16:11:53,530 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:11:53,541 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:11:53,542 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-92.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:11:53,584 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:11:53,594 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;@f0141db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:11:53,595 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:11:53,598 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 62 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:11:53,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-08 16:11:53,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:11:53,606 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:11:53,606 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:11:53,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:11:53,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816423975, now seen corresponding path program 1 times
[2025-03-08 16:11:53,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:11:53,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533167402]
[2025-03-08 16:11:53,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:53,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:11:53,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-08 16:11:53,684 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-08 16:11:53,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:53,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:53,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked.
[2025-03-08 16:11:53,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:11:53,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533167402]
[2025-03-08 16:11:53,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533167402] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:11:53,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978357418]
[2025-03-08 16:11:53,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:53,803 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:11:53,803 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:11:53,806 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:11:53,808 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 16:11:53,863 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-08 16:11:53,902 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-08 16:11:53,903 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:53,903 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:53,905 INFO  L256         TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:11:53,910 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:11:53,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked.
[2025-03-08 16:11:53,935 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:11:53,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978357418] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:11:53,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:11:53,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 16:11:53,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340639545]
[2025-03-08 16:11:53,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:11:53,955 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:11:53,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:11:53,968 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:11:53,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:11:53,969 INFO  L87              Difference]: Start difference. First operand  has 62 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2025-03-08 16:11:53,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:11:53,988 INFO  L93              Difference]: Finished difference Result 118 states and 194 transitions.
[2025-03-08 16:11:53,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:11:53,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123
[2025-03-08 16:11:53,990 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:11:53,993 INFO  L225             Difference]: With dead ends: 118
[2025-03-08 16:11:53,993 INFO  L226             Difference]: Without dead ends: 59
[2025-03-08 16:11:53,995 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:11:53,997 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:11:53,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:11:54,005 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-03-08 16:11:54,020 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2025-03-08 16:11:54,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:11:54,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions.
[2025-03-08 16:11:54,025 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 123
[2025-03-08 16:11:54,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:11:54,025 INFO  L471      AbstractCegarLoop]: Abstraction has 59 states and 85 transitions.
[2025-03-08 16:11:54,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19)
[2025-03-08 16:11:54,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions.
[2025-03-08 16:11:54,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-08 16:11:54,027 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:11:54,028 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:11:54,034 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 16:11:54,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 16:11:54,228 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:11:54,229 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:11:54,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -104778966, now seen corresponding path program 1 times
[2025-03-08 16:11:54,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:11:54,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121758601]
[2025-03-08 16:11:54,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:54,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:11:54,250 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-08 16:11:54,293 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-08 16:11:54,295 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:54,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:54,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2025-03-08 16:11:54,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:11:54,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121758601]
[2025-03-08 16:11:54,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121758601] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:11:54,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:11:54,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 16:11:54,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449866710]
[2025-03-08 16:11:54,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:11:54,633 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 16:11:54,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:11:54,634 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 16:11:54,634 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 16:11:54,634 INFO  L87              Difference]: Start difference. First operand 59 states and 85 transitions. Second operand  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2025-03-08 16:11:54,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:11:54,799 INFO  L93              Difference]: Finished difference Result 117 states and 169 transitions.
[2025-03-08 16:11:54,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 16:11:54,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123
[2025-03-08 16:11:54,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:11:54,801 INFO  L225             Difference]: With dead ends: 117
[2025-03-08 16:11:54,801 INFO  L226             Difference]: Without dead ends: 61
[2025-03-08 16:11:54,801 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 16:11:54,802 INFO  L435           NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 16:11:54,802 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 16:11:54,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2025-03-08 16:11:54,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59.
[2025-03-08 16:11:54,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:11:54,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions.
[2025-03-08 16:11:54,809 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 123
[2025-03-08 16:11:54,812 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:11:54,812 INFO  L471      AbstractCegarLoop]: Abstraction has 59 states and 84 transitions.
[2025-03-08 16:11:54,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)
[2025-03-08 16:11:54,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions.
[2025-03-08 16:11:54,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-08 16:11:54,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:11:54,814 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:11:54,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 16:11:54,814 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:11:54,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:11:54,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560229544, now seen corresponding path program 1 times
[2025-03-08 16:11:54,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:11:54,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107625889]
[2025-03-08 16:11:54,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:54,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:11:54,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:11:54,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:11:54,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:54,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:55,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2025-03-08 16:11:55,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:11:55,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107625889]
[2025-03-08 16:11:55,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107625889] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:11:55,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250052151]
[2025-03-08 16:11:55,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:55,197 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:11:55,197 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:11:55,201 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:11:55,202 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 16:11:55,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:11:55,281 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:11:55,281 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:55,281 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:55,284 INFO  L256         TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 16:11:55,287 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:11:55,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked.
[2025-03-08 16:11:55,372 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:11:55,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked.
[2025-03-08 16:11:55,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250052151] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 16:11:55,577 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 16:11:55,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-03-08 16:11:55,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399375868]
[2025-03-08 16:11:55,577 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:11:55,578 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 16:11:55,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:11:55,578 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 16:11:55,578 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2025-03-08 16:11:55,579 INFO  L87              Difference]: Start difference. First operand 59 states and 84 transitions. Second operand  has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 16:11:56,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:11:56,094 INFO  L93              Difference]: Finished difference Result 249 states and 345 transitions.
[2025-03-08 16:11:56,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-03-08 16:11:56,095 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125
[2025-03-08 16:11:56,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:11:56,098 INFO  L225             Difference]: With dead ends: 249
[2025-03-08 16:11:56,099 INFO  L226             Difference]: Without dead ends: 193
[2025-03-08 16:11:56,100 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702
[2025-03-08 16:11:56,102 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 175 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 16:11:56,102 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 430 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 16:11:56,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2025-03-08 16:11:56,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 65.
[2025-03-08 16:11:56,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:11:56,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions.
[2025-03-08 16:11:56,120 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 125
[2025-03-08 16:11:56,120 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:11:56,121 INFO  L471      AbstractCegarLoop]: Abstraction has 65 states and 89 transitions.
[2025-03-08 16:11:56,121 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 16:11:56,121 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions.
[2025-03-08 16:11:56,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-08 16:11:56,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:11:56,122 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:11:56,131 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 16:11:56,330 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2025-03-08 16:11:56,330 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:11:56,330 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:11:56,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -247224919, now seen corresponding path program 1 times
[2025-03-08 16:11:56,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:11:56,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586521661]
[2025-03-08 16:11:56,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:56,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:11:56,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:11:56,403 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:11:56,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:56,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 16:11:56,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314719689]
[2025-03-08 16:11:56,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:11:56,408 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:11:56,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:11:56,411 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:11:56,414 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 16:11:56,458 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:11:56,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:11:56,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:11:56,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:11:56,490 INFO  L256         TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-03-08 16:11:56,493 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:11:56,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked.
[2025-03-08 16:11:56,743 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 16:11:57,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 16:11:57,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586521661]
[2025-03-08 16:11:57,120 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-03-08 16:11:57,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314719689]
[2025-03-08 16:11:57,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314719689] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 16:11:57,120 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-03-08 16:11:57,121 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2025-03-08 16:11:57,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946985979]
[2025-03-08 16:11:57,121 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-03-08 16:11:57,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 16:11:57,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 16:11:57,122 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 16:11:57,122 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2025-03-08 16:11:57,122 INFO  L87              Difference]: Start difference. First operand 65 states and 89 transitions. Second operand  has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2025-03-08 16:12:00,567 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]
[2025-03-08 16:12:00,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:12:00,698 INFO  L93              Difference]: Finished difference Result 139 states and 185 transitions.
[2025-03-08 16:12:00,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 16:12:00,699 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 125
[2025-03-08 16:12:00,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:12:00,700 INFO  L225             Difference]: With dead ends: 139
[2025-03-08 16:12:00,700 INFO  L226             Difference]: Without dead ends: 77
[2025-03-08 16:12:00,701 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272
[2025-03-08 16:12:00,701 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time
[2025-03-08 16:12:00,701 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 154 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time]
[2025-03-08 16:12:00,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-03-08 16:12:00,710 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71.
[2025-03-08 16:12:00,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:12:00,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions.
[2025-03-08 16:12:00,711 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 125
[2025-03-08 16:12:00,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:12:00,712 INFO  L471      AbstractCegarLoop]: Abstraction has 71 states and 92 transitions.
[2025-03-08 16:12:00,712 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)
[2025-03-08 16:12:00,714 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions.
[2025-03-08 16:12:00,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-08 16:12:00,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:12:00,715 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:12:00,725 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 16:12:00,916 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:12:00,916 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:12:00,917 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:12:00,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -236721815, now seen corresponding path program 1 times
[2025-03-08 16:12:00,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 16:12:00,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14880119]
[2025-03-08 16:12:00,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:12:00,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 16:12:00,928 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:12:00,981 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:12:00,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:12:00,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 16:12:00,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144819914]
[2025-03-08 16:12:00,987 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:12:00,987 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:12:00,987 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:12:00,989 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 16:12:00,991 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 16:12:01,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:12:01,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:12:01,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:12:01,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:12:01,060 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 16:12:01,074 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 16:12:01,091 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 16:12:01,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:12:01,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 16:12:01,159 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 16:12:01,160 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 16:12:01,161 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 16:12:01,171 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-08 16:12:01,362 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 16:12:01,365 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-03-08 16:12:01,437 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 16:12:01,440 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:12:01 BoogieIcfgContainer
[2025-03-08 16:12:01,440 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 16:12:01,440 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 16:12:01,440 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 16:12:01,441 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 16:12:01,441 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:11:53" (3/4) ...
[2025-03-08 16:12:01,443 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 16:12:01,443 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 16:12:01,444 INFO  L158              Benchmark]: Toolchain (without parser) took 8575.88ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.2MB in the beginning and 123.5MB in the end (delta: -17.3MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB.
[2025-03-08 16:12:01,444 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:12:01,445 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 218.40ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:12:01,445 INFO  L158              Benchmark]: Boogie Procedure Inliner took 40.75ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 16:12:01,445 INFO  L158              Benchmark]: Boogie Preprocessor took 47.32ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:12:01,445 INFO  L158              Benchmark]: IcfgBuilder took 344.71ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 70.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 16:12:01,445 INFO  L158              Benchmark]: TraceAbstraction took 7916.04ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.1MB in the beginning and 123.5MB in the end (delta: -54.4MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB.
[2025-03-08 16:12:01,446 INFO  L158              Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 285.2MB. Free memory was 123.5MB in the beginning and 123.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 16:12:01,447 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 218.40ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 93.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 40.75ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 47.32ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 344.71ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 70.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7916.04ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 69.1MB in the beginning and 123.5MB in the end (delta: -54.4MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB.
 * Witness Printer took 3.37ms. Allocated memory is still 285.2MB. Free memory was 123.5MB in the beginning and 123.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 77. 
Possible FailurePath: 
[L21]                  unsigned char isInitial = 0;
[L22]                  signed char var_1_1 = 32;
[L23]                  signed char var_1_2 = 2;
[L24]                  signed char var_1_3 = 8;
[L25]                  signed char var_1_4 = 0;
[L26]                  signed char var_1_5 = 32;
[L27]                  signed char var_1_6 = 10;
[L28]                  double var_1_7 = 1000000.625;
[L29]                  double var_1_8 = 16.65;
[L30]                  double var_1_9 = 15.5;
[L31]                  signed short int var_1_10 = 500;
[L32]                  unsigned short int var_1_11 = 8;
[L33]                  unsigned char var_1_13 = 0;
[L34]                  unsigned short int var_1_14 = 100;
[L35]                  unsigned char var_1_15 = 0;
[L36]                  unsigned char var_1_16 = 0;
[L37]                  float var_1_17 = 2.4;
           VAL         [isInitial=0, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L98]                  isInitial = 1
[L99]      FCALL       initially()
[L100]     COND TRUE   1
[L101]     FCALL       updateLastVariables()
[L102]     CALL        updateVariables()
[L61]                  var_1_2 = __VERIFIER_nondet_char()
[L62]      CALL        assume_abort_if_not(var_1_2 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L62]      RET         assume_abort_if_not(var_1_2 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L63]      CALL        assume_abort_if_not(var_1_2 <= 63)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L63]      RET         assume_abort_if_not(var_1_2 <= 63)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L64]                  var_1_3 = __VERIFIER_nondet_char()
[L65]      CALL        assume_abort_if_not(var_1_3 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L65]      RET         assume_abort_if_not(var_1_3 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L66]      CALL        assume_abort_if_not(var_1_3 <= 63)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L66]      RET         assume_abort_if_not(var_1_3 <= 63)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L67]                  var_1_4 = __VERIFIER_nondet_char()
[L68]      CALL        assume_abort_if_not(var_1_4 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L68]      RET         assume_abort_if_not(var_1_4 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L69]      CALL        assume_abort_if_not(var_1_4 <= 126)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L69]      RET         assume_abort_if_not(var_1_4 <= 126)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L70]                  var_1_5 = __VERIFIER_nondet_char()
[L71]      CALL        assume_abort_if_not(var_1_5 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L71]      RET         assume_abort_if_not(var_1_5 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L72]      CALL        assume_abort_if_not(var_1_5 <= 63)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L72]      RET         assume_abort_if_not(var_1_5 <= 63)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L73]                  var_1_6 = __VERIFIER_nondet_char()
[L74]      CALL        assume_abort_if_not(var_1_6 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L74]      RET         assume_abort_if_not(var_1_6 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L75]      CALL        assume_abort_if_not(var_1_6 <= 63)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L75]      RET         assume_abort_if_not(var_1_6 <= 63)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2]
[L76]                  var_1_8 = __VERIFIER_nondet_double()
[L77]      CALL        assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2]
[L77]      RET         assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2]
[L78]                  var_1_9 = __VERIFIER_nondet_double()
[L79]      CALL        assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L79]      RET         assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L80]                  var_1_14 = __VERIFIER_nondet_ushort()
[L81]      CALL        assume_abort_if_not(var_1_14 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L81]      RET         assume_abort_if_not(var_1_14 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L82]      CALL        assume_abort_if_not(var_1_14 <= 65535)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L82]      RET         assume_abort_if_not(var_1_14 <= 65535)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L83]      CALL        assume_abort_if_not(var_1_14 != 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L83]      RET         assume_abort_if_not(var_1_14 != 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L84]                  var_1_15 = __VERIFIER_nondet_uchar()
[L85]      CALL        assume_abort_if_not(var_1_15 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L85]      RET         assume_abort_if_not(var_1_15 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L86]      CALL        assume_abort_if_not(var_1_15 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L86]      RET         assume_abort_if_not(var_1_15 <= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L87]                  var_1_16 = __VERIFIER_nondet_uchar()
[L88]      CALL        assume_abort_if_not(var_1_16 >= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L88]      RET         assume_abort_if_not(var_1_16 >= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L89]      CALL        assume_abort_if_not(var_1_16 <= 0)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L20]      COND FALSE  !(!cond)
           VAL         [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L89]      RET         assume_abort_if_not(var_1_16 <= 0)
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L102]     RET         updateVariables()
[L103]     CALL        step()
[L41]                  var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6)))))
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L42]      EXPR        var_1_6 & var_1_3
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8]
[L42]                  signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3);
[L43]      COND TRUE   stepLocal_0 >= var_1_4
[L44]                  var_1_7 = var_1_8
           VAL         [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L48]                  var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))
[L49]                  signed long int stepLocal_1 = var_1_6 / var_1_14;
           VAL         [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L50]      COND FALSE  !(stepLocal_1 < -100)
[L53]                  var_1_13 = (var_1_15 && var_1_16)
           VAL         [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L55]                  var_1_17 = var_1_8
           VAL         [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L56]      COND TRUE   ! var_1_13
[L57]                  var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64))
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L103]     RET         step()
[L104]     CALL, EXPR  property()
[L94]      EXPR        (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L94]      EXPR        var_1_6 & var_1_3
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L94]      EXPR        (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L94-L95]              return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8))
;
[L104]     RET, EXPR   property()
[L104]     CALL        __VERIFIER_assert(property())
[L19]      COND TRUE   !(cond)
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]
[L19]                  reach_error()
           VAL         [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 62 locations, 109 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 839 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 296 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 136 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1119 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 862 ConstructedInterpolants, 1 QuantifiedInterpolants, 2346 SizeOfPredicates, 4 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4695/4788 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 16:12:01,469 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 16:12:03,287 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 16:12:03,367 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 16:12:03,374 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 16:12:03,375 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 16:12:03,392 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 16:12:03,392 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 16:12:03,392 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 16:12:03,393 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 16:12:03,393 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 16:12:03,393 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 16:12:03,393 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 16:12:03,393 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 16:12:03,394 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:12:03,394 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 16:12:03,394 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 16:12:03,395 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20
[2025-03-08 16:12:03,646 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 16:12:03,651 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 16:12:03,653 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 16:12:03,654 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 16:12:03,654 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 16:12:03,654 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:12:04,817 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6048047bb/d1e0d40be8b54d40b91a53ec969dd25d/FLAG9ba868b66
[2025-03-08 16:12:05,033 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 16:12:05,034 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:12:05,042 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6048047bb/d1e0d40be8b54d40b91a53ec969dd25d/FLAG9ba868b66
[2025-03-08 16:12:05,056 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6048047bb/d1e0d40be8b54d40b91a53ec969dd25d
[2025-03-08 16:12:05,058 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 16:12:05,059 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 16:12:05,060 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 16:12:05,060 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 16:12:05,063 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 16:12:05,064 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,066 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1206a457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05, skipping insertion in model container
[2025-03-08 16:12:05,066 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,079 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 16:12:05,183 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_variablewrapping_normal_file-92.i[913,926]
[2025-03-08 16:12:05,215 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:12:05,230 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 16:12:05,241 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_variablewrapping_normal_file-92.i[913,926]
[2025-03-08 16:12:05,268 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 16:12:05,281 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 16:12:05,281 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05 WrapperNode
[2025-03-08 16:12:05,282 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 16:12:05,282 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 16:12:05,283 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 16:12:05,283 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 16:12:05,286 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,296 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,309 INFO  L138                Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109
[2025-03-08 16:12:05,309 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 16:12:05,310 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 16:12:05,310 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 16:12:05,310 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 16:12:05,316 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,316 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,318 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,327 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 16:12:05,328 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,328 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,334 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,335 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,336 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,337 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,339 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 16:12:05,339 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 16:12:05,339 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 16:12:05,339 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 16:12:05,340 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (1/1) ...
[2025-03-08 16:12:05,344 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 16:12:05,352 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 16:12:05,362 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 16:12:05,364 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 16:12:05,381 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 16:12:05,381 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 16:12:05,381 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 16:12:05,381 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 16:12:05,382 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 16:12:05,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 16:12:05,435 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 16:12:05,436 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 16:12:05,862 INFO  L?                        ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2025-03-08 16:12:05,862 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 16:12:05,870 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 16:12:05,870 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 16:12:05,870 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:12:05 BoogieIcfgContainer
[2025-03-08 16:12:05,870 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 16:12:05,872 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 16:12:05,872 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 16:12:05,875 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 16:12:05,875 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:12:05" (1/3) ...
[2025-03-08 16:12:05,876 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1d8024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:12:05, skipping insertion in model container
[2025-03-08 16:12:05,876 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:12:05" (2/3) ...
[2025-03-08 16:12:05,876 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1d8024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:12:05, skipping insertion in model container
[2025-03-08 16:12:05,876 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:12:05" (3/3) ...
[2025-03-08 16:12:05,877 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i
[2025-03-08 16:12:05,886 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 16:12:05,887 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-92.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 16:12:05,928 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 16:12:05,941 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;@514d4cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 16:12:05,941 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 16:12:05,945 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:12:05,954 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-03-08 16:12:05,955 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:12:05,955 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:12:05,956 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:12:05,960 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:12:05,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547422302, now seen corresponding path program 1 times
[2025-03-08 16:12:05,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:12:05,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110296559]
[2025-03-08 16:12:05,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:12:05,973 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:12:05,973 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:12:05,976 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:12:05,978 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-08 16:12:06,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-03-08 16:12:06,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-03-08 16:12:06,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:12:06,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:12:06,181 INFO  L256         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 16:12:06,186 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 16:12:06,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked.
[2025-03-08 16:12:06,223 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 16:12:06,224 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 16:12:06,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110296559]
[2025-03-08 16:12:06,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110296559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 16:12:06,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 16:12:06,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 16:12:06,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47642381]
[2025-03-08 16:12:06,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 16:12:06,230 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 16:12:06,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 16:12:06,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 16:12:06,245 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:12:06,246 INFO  L87              Difference]: Start difference. First operand  has 52 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2025-03-08 16:12:06,265 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 16:12:06,266 INFO  L93              Difference]: Finished difference Result 98 states and 164 transitions.
[2025-03-08 16:12:06,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 16:12:06,267 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119
[2025-03-08 16:12:06,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 16:12:06,272 INFO  L225             Difference]: With dead ends: 98
[2025-03-08 16:12:06,272 INFO  L226             Difference]: Without dead ends: 49
[2025-03-08 16:12:06,275 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 16:12:06,278 INFO  L435           NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 16:12:06,278 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 16:12:06,288 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-03-08 16:12:06,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2025-03-08 16:12:06,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19)
[2025-03-08 16:12:06,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions.
[2025-03-08 16:12:06,313 INFO  L78                 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 119
[2025-03-08 16:12:06,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 16:12:06,313 INFO  L471      AbstractCegarLoop]: Abstraction has 49 states and 70 transitions.
[2025-03-08 16:12:06,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2025-03-08 16:12:06,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions.
[2025-03-08 16:12:06,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-03-08 16:12:06,316 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 16:12:06,317 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 16:12:06,325 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2025-03-08 16:12:06,520 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:12:06,521 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 16:12:06,522 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 16:12:06,522 INFO  L85        PathProgramCache]: Analyzing trace with hash 529631457, now seen corresponding path program 1 times
[2025-03-08 16:12:06,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 16:12:06,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700453103]
[2025-03-08 16:12:06,522 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 16:12:06,523 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 16:12:06,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 16:12:06,525 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 16:12:06,528 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-08 16:12:06,585 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-03-08 16:12:06,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-03-08 16:12:06,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 16:12:06,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 16:12:06,730 INFO  L256         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 47 conjuncts are in the unsatisfiable core
[2025-03-08 16:12:06,739 INFO  L279         TraceCheckSpWp]: Computing forward predicates...