./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:02:36,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:02:36,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:02:36,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:02:36,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:02:36,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:02:36,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:02:36,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:02:36,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:02:36,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:02:36,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:02:36,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:02:36,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:02:36,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:02:36,645 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:02:36,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:02:36,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:02:36,647 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:36,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:02:36,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:02:36,648 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d [2025-02-06 03:02:36,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:02:36,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:02:36,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:02:36,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:02:36,876 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:02:36,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:38,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2990a7fab/f6a8616b0ec3427ab16526e61d697023/FLAG7af7f8a61 [2025-02-06 03:02:38,313 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:02:38,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:38,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2990a7fab/f6a8616b0ec3427ab16526e61d697023/FLAG7af7f8a61 [2025-02-06 03:02:38,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2990a7fab/f6a8616b0ec3427ab16526e61d697023 [2025-02-06 03:02:38,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:02:38,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:02:38,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:38,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:02:38,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:02:38,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f783f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38, skipping insertion in model container [2025-02-06 03:02:38,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:02:38,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i[913,926] [2025-02-06 03:02:38,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:38,525 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:02:38,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i[913,926] [2025-02-06 03:02:38,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:38,572 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:02:38,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38 WrapperNode [2025-02-06 03:02:38,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:38,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:38,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:02:38,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:02:38,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,609 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-02-06 03:02:38,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:38,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:02:38,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:02:38,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:02:38,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:02:38,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:02:38,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:02:38,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:02:38,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:02:38,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (1/1) ... [2025-02-06 03:02:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:38,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:38,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:02:38,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:02:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:02:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:02:38,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:02:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:02:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:02:38,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:02:38,777 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:02:38,779 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:02:38,992 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 03:02:38,992 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:02:38,998 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:02:38,998 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:02:38,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:38 BoogieIcfgContainer [2025-02-06 03:02:38,998 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:02:39,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:02:39,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:02:39,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:02:39,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:02:38" (1/3) ... [2025-02-06 03:02:39,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422a6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:39, skipping insertion in model container [2025-02-06 03:02:39,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:38" (2/3) ... [2025-02-06 03:02:39,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422a6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:39, skipping insertion in model container [2025-02-06 03:02:39,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:38" (3/3) ... [2025-02-06 03:02:39,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:39,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:02:39,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:02:39,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:02:39,059 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;@43574659, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:02:39,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:02:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:39,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:39,067 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:39,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-02-06 03:02:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705454155] [2025-02-06 03:02:39,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:39,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:39,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:39,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:39,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:02:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705454155] [2025-02-06 03:02:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705454155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:02:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959288047] [2025-02-06 03:02:39,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:39,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:02:39,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:02:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:39,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:39,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:39,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:39,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:02:39,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:02:39,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:02:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959288047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:02:39,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:02:39,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:02:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822224966] [2025-02-06 03:02:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:02:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:02:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:39,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:02:39,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:02:39,457 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:02:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:39,477 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-06 03:02:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:02:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-02-06 03:02:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:39,483 INFO L225 Difference]: With dead ends: 100 [2025-02-06 03:02:39,483 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 03:02:39,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:02:39,487 INFO L435 NwaCegarLoop]: 73 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, 73 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-02-06 03:02:39,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:02:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 03:02:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 03:02:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-02-06 03:02:39,541 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-02-06 03:02:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-02-06 03:02:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:02:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-02-06 03:02:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:39,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:39,544 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:39,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:02:39,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:02:39,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:39,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-02-06 03:02:39,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:39,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363186558] [2025-02-06 03:02:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:39,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:39,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:39,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:02:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363186558] [2025-02-06 03:02:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363186558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:02:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:02:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:02:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256823117] [2025-02-06 03:02:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:02:39,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:02:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:39,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:02:39,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:02:39,912 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:02:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:39,945 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2025-02-06 03:02:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:02:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2025-02-06 03:02:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:39,948 INFO L225 Difference]: With dead ends: 142 [2025-02-06 03:02:39,948 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:02:39,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:02:39,949 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:39,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:02:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:02:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2025-02-06 03:02:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-02-06 03:02:39,962 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2025-02-06 03:02:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-02-06 03:02:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:02:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-02-06 03:02:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:39,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:39,967 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:02:39,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1532463775, now seen corresponding path program 1 times [2025-02-06 03:02:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170271259] [2025-02-06 03:02:39,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:39,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:40,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:40,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:02:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:02:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170271259] [2025-02-06 03:02:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170271259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:02:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791325871] [2025-02-06 03:02:40,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:40,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:02:40,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:02:40,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:40,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:40,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:40,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:40,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:02:40,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 03:02:40,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:02:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:02:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791325871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:02:40,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:02:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 03:02:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418650604] [2025-02-06 03:02:40,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:02:40,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:02:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:02:40,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:02:40,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:02:40,839 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:02:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:41,260 INFO L93 Difference]: Finished difference Result 214 states and 296 transitions. [2025-02-06 03:02:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:02:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-02-06 03:02:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:41,262 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:02:41,264 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 03:02:41,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:02:41,268 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:41,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 228 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:02:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 03:02:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-02-06 03:02:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-02-06 03:02:41,286 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-02-06 03:02:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:41,289 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-02-06 03:02:41,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:02:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-02-06 03:02:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:41,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:41,290 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:41,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:02:41,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:02:41,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:41,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-02-06 03:02:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:02:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731814376] [2025-02-06 03:02:41,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:02:41,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:41,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:41,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:02:41,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:02:41,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:41,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:41,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:41,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:02:41,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:02:41,665 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:02:41,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:02:41,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:02:41,669 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 03:02:41,736 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:02:41,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:02:41 BoogieIcfgContainer [2025-02-06 03:02:41,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:02:41,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:02:41,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:02:41,739 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:02:41,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:38" (3/4) ... [2025-02-06 03:02:41,741 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:02:41,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:02:41,742 INFO L158 Benchmark]: Toolchain (without parser) took 3392.92ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 110.9MB in the beginning and 248.3MB in the end (delta: -137.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2025-02-06 03:02:41,742 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:41,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 98.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:02:41,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:02:41,742 INFO L158 Benchmark]: Boogie Preprocessor took 29.71ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:41,743 INFO L158 Benchmark]: IcfgBuilder took 355.38ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:02:41,743 INFO L158 Benchmark]: TraceAbstraction took 2737.79ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 76.2MB in the beginning and 249.6MB in the end (delta: -173.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2025-02-06 03:02:41,743 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 293.6MB. Free memory was 248.4MB in the beginning and 248.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:02:41,744 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.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.63ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 98.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.4MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.71ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.38ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2737.79ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 76.2MB in the beginning and 249.6MB in the end (delta: -173.4MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 293.6MB. Free memory was 248.4MB in the beginning and 248.3MB 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] float var_1_4 = 255.1; [L24] float var_1_5 = -0.6; [L25] signed short int var_1_6 = -10; [L26] unsigned char var_1_8 = 1; [L27] signed char var_1_11 = -2; [L28] signed char var_1_12 = 10; [L29] signed char var_1_13 = 5; [L30] signed char var_1_14 = -1; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 5; [L35] unsigned char var_1_19 = 64; [L36] unsigned char var_1_20 = 5; [L37] unsigned char last_1_var_1_18 = 5; VAL [isInitial=0, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_4=2551/10, var_1_6=-10, var_1_8=1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L71] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L72] var_1_5 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L73] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=1] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L77] var_1_12 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L78] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L79] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L80] var_1_13 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L81] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L82] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=-1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L83] var_1_14 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L84] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L85] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L86] var_1_16 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L87] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L88] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L89] var_1_17 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L90] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L91] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L92] var_1_19 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_19 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L93] RET assume_abort_if_not(var_1_19 >= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L94] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=5, var_1_6=-10, var_1_8=0] [L95] var_1_20 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L96] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_6=-10, var_1_8=0] [L97] CALL assume_abort_if_not(var_1_20 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L97] RET assume_abort_if_not(var_1_20 <= 32) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_0=-6, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_1=24/5, var_1_20=-256, var_1_6=-10, var_1_8=0] [L42] COND TRUE last_1_var_1_18 >= stepLocal_0 [L43] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L45] unsigned char stepLocal_1 = (var_1_1 * var_1_5) >= var_1_4; VAL [isInitial=1, last_1_var_1_18=5, stepLocal_1=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=5, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L46] COND TRUE var_1_17 && stepLocal_1 [L47] var_1_18 = (2 + ((var_1_19 - var_1_20) + 32)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=1, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L51] COND FALSE !(\read(var_1_8)) [L54] var_1_15 = (! var_1_17) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L56] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-10, var_1_8=0] [L59] COND FALSE !(\read(var_1_15)) [L66] var_1_6 = var_1_11 VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((((last_1_var_1_18 >= (~ last_1_var_1_18)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_15 ? (var_1_15 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_15 ? (var_1_11 == ((signed char) ((var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))) + var_1_14))) : 1)) && (var_1_8 ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) (! var_1_17))))) && ((var_1_17 && ((var_1_1 * var_1_5) >= var_1_4)) ? (var_1_18 == ((unsigned char) (2 + ((var_1_19 - var_1_20) + 32)))) : (var_1_18 == ((unsigned char) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=5, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=66, var_1_19=65312, var_1_20=-256, var_1_6=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 201 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 3 MinimizatonAttempts, 154 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 2 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 3584/3672 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-02-06 03:02:41,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:02:43,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:02:43,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:02:43,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:02:43,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:02:43,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:02:43,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:02:43,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:02:43,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:02:43,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:02:43,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:02:43,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:02:43,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:02:43,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:02:43,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:02:43,975 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:02:43,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:02:43,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:43,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:02:43,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ec09e5648980bc5a4329f49d7e2504b195b194638f2d82967f3c7db0031611d [2025-02-06 03:02:44,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:02:44,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:02:44,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:02:44,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:02:44,267 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:02:44,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:45,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/befcbe393/85782873179d4f2b81bd53cfc092c3c5/FLAGbbf8acc86 [2025-02-06 03:02:45,652 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:02:45,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:45,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/befcbe393/85782873179d4f2b81bd53cfc092c3c5/FLAGbbf8acc86 [2025-02-06 03:02:45,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/befcbe393/85782873179d4f2b81bd53cfc092c3c5 [2025-02-06 03:02:45,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:02:45,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:02:45,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:45,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:02:45,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:02:45,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5c306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45, skipping insertion in model container [2025-02-06 03:02:45,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:02:45,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i[913,926] [2025-02-06 03:02:45,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:45,853 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:02:45,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-35.i[913,926] [2025-02-06 03:02:45,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:02:45,900 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:02:45,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45 WrapperNode [2025-02-06 03:02:45,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:02:45,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:45,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:02:45,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:02:45,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,938 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-02-06 03:02:45,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:02:45,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:02:45,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:02:45,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:02:45,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 03:02:45,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:02:45,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:02:45,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:02:45,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:02:45,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (1/1) ... [2025-02-06 03:02:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:02:45,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:02:46,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:02:46,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:02:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:02:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:02:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:02:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:02:46,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:02:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:02:46,088 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:02:46,089 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:02:46,849 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 03:02:46,849 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:02:46,857 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:02:46,858 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:02:46,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:46 BoogieIcfgContainer [2025-02-06 03:02:46,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:02:46,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:02:46,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:02:46,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:02:46,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:02:45" (1/3) ... [2025-02-06 03:02:46,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ebe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:46, skipping insertion in model container [2025-02-06 03:02:46,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:02:45" (2/3) ... [2025-02-06 03:02:46,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ebe03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:02:46, skipping insertion in model container [2025-02-06 03:02:46,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:02:46" (3/3) ... [2025-02-06 03:02:46,867 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-35.i [2025-02-06 03:02:46,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:02:46,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-35.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:02:46,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:02:46,925 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;@6a57002e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:02:46,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:02:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:46,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:46,936 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:46,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:46,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:46,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1946220228, now seen corresponding path program 1 times [2025-02-06 03:02:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:02:46,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412800700] [2025-02-06 03:02:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:46,953 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-02-06 03:02:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:02:46,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 03:02:46,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:02:47,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:47,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:47,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:47,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:47,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:02:47,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-02-06 03:02:47,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:02:47,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:02:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412800700] [2025-02-06 03:02:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412800700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:02:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:02:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:02:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907205365] [2025-02-06 03:02:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:02:47,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:02:47,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:02:47,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:02:47,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:02:47,272 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:02:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:47,290 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-02-06 03:02:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:02:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2025-02-06 03:02:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:47,296 INFO L225 Difference]: With dead ends: 100 [2025-02-06 03:02:47,296 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 03:02:47,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:02:47,300 INFO L435 NwaCegarLoop]: 73 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, 73 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-02-06 03:02:47,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:02:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 03:02:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 03:02:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-02-06 03:02:47,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 115 [2025-02-06 03:02:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:47,324 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-02-06 03:02:47,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:02:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-02-06 03:02:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:47,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:47,327 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:47,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:02:47,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 03:02:47,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1561092926, now seen corresponding path program 1 times [2025-02-06 03:02:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:02:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052485690] [2025-02-06 03:02:47,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:47,533 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-02-06 03:02:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:02:47,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 03:02:47,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:02:47,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:47,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:47,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:47,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:47,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:02:47,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:02:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 03:02:48,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:02:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:02:48,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:02:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052485690] [2025-02-06 03:02:48,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052485690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:02:48,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:02:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-02-06 03:02:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023137011] [2025-02-06 03:02:48,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:02:48,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:02:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:02:48,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:02:48,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:02:48,228 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:02:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:02:49,172 INFO L93 Difference]: Finished difference Result 213 states and 300 transitions. [2025-02-06 03:02:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:02:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2025-02-06 03:02:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:02:49,175 INFO L225 Difference]: With dead ends: 213 [2025-02-06 03:02:49,175 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 03:02:49,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:02:49,176 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 160 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:02:49,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 185 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:02:49,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 03:02:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 56. [2025-02-06 03:02:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:02:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-02-06 03:02:49,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 115 [2025-02-06 03:02:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:02:49,191 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-02-06 03:02:49,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 03:02:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-02-06 03:02:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:02:49,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:02:49,192 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:02:49,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-06 03:02:49,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 03:02:49,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:02:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:02:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -644960094, now seen corresponding path program 1 times [2025-02-06 03:02:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:02:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625976769] [2025-02-06 03:02:49,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:02:49,396 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-02-06 03:02:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:02:49,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 03:02:49,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Waiting until timeout for monitored process [2025-02-06 03:02:49,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:02:49,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:02:49,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:02:49,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:02:49,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:02:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates...