./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-93.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_codestructure_dependencies_file-93.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 b4804657cb22640a3af09bfa7720053cc027643d3a01c862cc2148d596a7b562 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:28:04,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:28:04,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:28:04,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:28:04,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:28:04,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:28:04,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:28:04,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:28:04,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:28:04,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:28:04,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:28:04,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:28:04,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:28:04,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:28:04,590 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:28:04,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:28:04,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:28:04,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:28:04,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:28:04,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:28:04,592 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 -> b4804657cb22640a3af09bfa7720053cc027643d3a01c862cc2148d596a7b562 [2025-02-05 20:28:04,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:28:04,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:28:04,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:28:04,833 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:28:04,833 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:28:04,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:05,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0377003a/b7a14bca32e94cc1b39e040017c6e9e0/FLAG72bd3b48d [2025-02-05 20:28:06,236 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:28:06,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:06,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0377003a/b7a14bca32e94cc1b39e040017c6e9e0/FLAG72bd3b48d [2025-02-05 20:28:06,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0377003a/b7a14bca32e94cc1b39e040017c6e9e0 [2025-02-05 20:28:06,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:28:06,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:28:06,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:28:06,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:28:06,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:28:06,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06, skipping insertion in model container [2025-02-05 20:28:06,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:28:06,407 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_codestructure_dependencies_file-93.i[919,932] [2025-02-05 20:28:06,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:28:06,461 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:28:06,470 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_codestructure_dependencies_file-93.i[919,932] [2025-02-05 20:28:06,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:28:06,511 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:28:06,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06 WrapperNode [2025-02-05 20:28:06,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:28:06,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:28:06,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:28:06,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:28:06,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,537 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-02-05 20:28:06,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:28:06,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:28:06,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:28:06,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:28:06,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,555 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-05 20:28:06,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:28:06,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:28:06,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:28:06,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:28:06,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (1/1) ... [2025-02-05 20:28:06,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:28:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:28:06,601 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-05 20:28:06,604 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-05 20:28:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:28:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:28:06,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:28:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:28:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:28:06,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:28:06,678 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:28:06,679 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:28:06,861 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:28:06,862 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:28:06,868 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:28:06,869 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:28:06,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:28:06 BoogieIcfgContainer [2025-02-05 20:28:06,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:28:06,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:28:06,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:28:06,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:28:06,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:28:06" (1/3) ... [2025-02-05 20:28:06,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a54bf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:28:06, skipping insertion in model container [2025-02-05 20:28:06,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:06" (2/3) ... [2025-02-05 20:28:06,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a54bf26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:28:06, skipping insertion in model container [2025-02-05 20:28:06,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:28:06" (3/3) ... [2025-02-05 20:28:06,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:06,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:28:06,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-93.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:28:06,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:28:06,934 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;@48c3f2a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:28:06,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:28:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:28:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:28:06,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:06,945 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:06,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1483420550, now seen corresponding path program 1 times [2025-02-05 20:28:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:28:06,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400160607] [2025-02-05 20:28:06,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:06,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:28:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:28:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:28:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:28:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:28:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400160607] [2025-02-05 20:28:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400160607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:28:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169403709] [2025-02-05 20:28:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:28:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:28:07,188 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-05 20:28:07,192 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-05 20:28:07,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:28:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:28:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:07,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:28:07,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:28:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 20:28:07,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:28:07,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169403709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:28:07,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:28:07,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:28:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143561132] [2025-02-05 20:28:07,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:28:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:28:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:28:07,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:28:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:28:07,382 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:28:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:28:07,401 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2025-02-05 20:28:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:28:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-02-05 20:28:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:28:07,408 INFO L225 Difference]: With dead ends: 134 [2025-02-05 20:28:07,408 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 20:28:07,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-05 20:28:07,413 INFO L435 NwaCegarLoop]: 103 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, 103 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-05 20:28:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:28:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 20:28:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 20:28:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:28:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2025-02-05 20:28:07,442 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 161 [2025-02-05 20:28:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:28:07,443 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2025-02-05 20:28:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:28:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2025-02-05 20:28:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:28:07,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:07,445 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:07,452 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-05 20:28:07,650 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-05 20:28:07,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1310842602, now seen corresponding path program 1 times [2025-02-05 20:28:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:28:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-02-05 20:28:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:28:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:28:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:28:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:28:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:28:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-02-05 20:28:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717594152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:28:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:28:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:28:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149961221] [2025-02-05 20:28:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:28:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:28:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:28:07,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:28:07,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:28:07,867 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:28:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:28:07,914 INFO L93 Difference]: Finished difference Result 160 states and 244 transitions. [2025-02-05 20:28:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:28:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-02-05 20:28:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:28:07,916 INFO L225 Difference]: With dead ends: 160 [2025-02-05 20:28:07,916 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 20:28:07,916 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-05 20:28:07,917 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:28:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:28:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 20:28:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-02-05 20:28:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:28:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-02-05 20:28:07,933 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 161 [2025-02-05 20:28:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:28:07,933 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-02-05 20:28:07,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:28:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-02-05 20:28:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:28:07,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:07,939 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:28:07,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1598340147, now seen corresponding path program 1 times [2025-02-05 20:28:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:28:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016962060] [2025-02-05 20:28:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:28:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:28:08,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:28:08,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:08,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:28:08,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:28:08,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:28:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:28:08,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:08,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:28:08,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:28:08,224 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:28:08,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:28:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:28:08,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:28:08,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:28:08,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:28:08 BoogieIcfgContainer [2025-02-05 20:28:08,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:28:08,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:28:08,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:28:08,306 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:28:08,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:28:06" (3/4) ... [2025-02-05 20:28:08,308 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:28:08,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:28:08,309 INFO L158 Benchmark]: Toolchain (without parser) took 2018.55ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 89.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-02-05 20:28:08,310 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:28:08,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.52ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 93.6MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:28:08,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.80ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:28:08,315 INFO L158 Benchmark]: Boogie Preprocessor took 28.06ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 88.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:28:08,316 INFO L158 Benchmark]: IcfgBuilder took 299.19ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:28:08,316 INFO L158 Benchmark]: TraceAbstraction took 1434.35ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 89.0MB in the end (delta: -19.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-02-05 20:28:08,316 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 89.0MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:28:08,317 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 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.52ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 93.6MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.80ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.06ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 88.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.19ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 69.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1434.35ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 89.0MB in the end (delta: -19.2MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 89.0MB in the end (delta: 37.0kB). 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] float var_1_5 = 0.0; [L24] float var_1_6 = 4.2; [L25] float var_1_7 = 31.25; [L26] float var_1_8 = 1.375; [L27] unsigned short int var_1_9 = 32; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = 0.625; [L30] unsigned short int var_1_12 = 1; [L31] float var_1_13 = -0.25; [L32] signed short int var_1_14 = 4; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_17 = 8; [L36] signed short int var_1_18 = 5; [L37] signed short int var_1_19 = 128; [L38] signed long int var_1_20 = -50; [L39] signed short int var_1_21 = -16; [L40] signed short int var_1_22 = 16; [L41] signed short int var_1_23 = 32; [L42] signed short int var_1_24 = 2; [L43] signed short int var_1_25 = -4; VAL [isInitial=0, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_5=0, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L90] var_1_5 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L91] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L92] var_1_6 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L93] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L94] var_1_7 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L95] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L96] var_1_8 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L101] var_1_11 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L102] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L103] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L103] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L104] var_1_12 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L107] var_1_15 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L108] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L113] var_1_17 = __VERIFIER_nondet_short() [L114] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L114] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L116] var_1_18 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L117] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L119] var_1_19 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L120] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L123] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L125] var_1_24 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L126] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L127] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-4, var_1_9=32] [L128] var_1_25 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L129] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L130] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_9=32] [L143] RET updateVariables() [L144] CALL step() [L47] COND TRUE \read(var_1_10) [L48] var_1_13 = ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=32] [L52] COND TRUE (! (var_1_10 || var_1_15)) || var_1_16 [L53] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=32] [L55] COND TRUE \read(var_1_15) [L56] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-1, var_1_22=0, var_1_23=32, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=32] [L58] COND TRUE \read(var_1_10) [L59] var_1_23 = (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=32] [L67] COND TRUE var_1_10 || (var_1_13 < (var_1_8 / var_1_11)) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=32] [L68] COND TRUE var_1_10 || (var_1_13 != var_1_11) [L69] var_1_9 = 8 VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-50, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=8] [L74] COND TRUE \read(var_1_16) [L75] var_1_20 = (var_1_9 - 50) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=1/2, var_1_20=-42, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_9=8] [L77] COND FALSE !((var_1_20 + var_1_14) < var_1_21) [L86] var_1_1 = var_1_8 VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=32772, var_1_20=-42, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_8=32772, var_1_9=8] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((((var_1_20 + var_1_14) < var_1_21) ? ((var_1_21 <= (var_1_14 - var_1_20)) ? ((var_1_21 < var_1_14) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_13 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_13 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_9 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=32772, var_1_20=-42, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_8=32772, var_1_9=8] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=32772, var_1_20=-42, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_8=32772, var_1_9=8] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=32771, var_1_14=32740, var_1_15=1, var_1_16=1, var_1_17=32740, var_1_18=32766, var_1_19=26, var_1_1=32772, var_1_20=-42, var_1_21=-1, var_1_22=0, var_1_23=-8191, var_1_24=0, var_1_25=-8191, var_1_5=32771, var_1_7=32771, var_1_8=32772, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 200 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-05 20:28:08,332 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_codestructure_dependencies_file-93.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 b4804657cb22640a3af09bfa7720053cc027643d3a01c862cc2148d596a7b562 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:28:10,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:28:10,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:28:10,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:28:10,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:28:10,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:28:10,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:28:10,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:28:10,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:28:10,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:28:10,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:28:10,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:28:10,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:28:10,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:28:10,409 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:28:10,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:28:10,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:28:10,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:28:10,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:28:10,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:28:10,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:28:10,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:28:10,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:28:10,411 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 -> b4804657cb22640a3af09bfa7720053cc027643d3a01c862cc2148d596a7b562 [2025-02-05 20:28:10,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:28:10,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:28:10,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:28:10,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:28:10,708 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:28:10,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:11,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a319842e9/45d7a5ae24e84cab8385a3279eb9f7e8/FLAGb7ee2fa4c [2025-02-05 20:28:12,160 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:28:12,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:12,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a319842e9/45d7a5ae24e84cab8385a3279eb9f7e8/FLAGb7ee2fa4c [2025-02-05 20:28:12,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a319842e9/45d7a5ae24e84cab8385a3279eb9f7e8 [2025-02-05 20:28:12,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:28:12,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:28:12,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:28:12,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:28:12,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:28:12,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b356991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12, skipping insertion in model container [2025-02-05 20:28:12,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:28:12,318 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_codestructure_dependencies_file-93.i[919,932] [2025-02-05 20:28:12,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:28:12,386 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:28:12,393 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_codestructure_dependencies_file-93.i[919,932] [2025-02-05 20:28:12,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:28:12,441 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:28:12,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12 WrapperNode [2025-02-05 20:28:12,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:28:12,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:28:12,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:28:12,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:28:12,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,480 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-02-05 20:28:12,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:28:12,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:28:12,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:28:12,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:28:12,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,505 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-05 20:28:12,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:28:12,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:28:12,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:28:12,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:28:12,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (1/1) ... [2025-02-05 20:28:12,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:28:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:28:12,543 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-05 20:28:12,549 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-05 20:28:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:28:12,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:28:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:28:12,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:28:12,628 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:28:12,630 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:28:19,543 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:28:19,543 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:28:19,554 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:28:19,554 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:28:19,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:28:19 BoogieIcfgContainer [2025-02-05 20:28:19,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:28:19,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:28:19,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:28:19,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:28:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:28:12" (1/3) ... [2025-02-05 20:28:19,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751fb5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:28:19, skipping insertion in model container [2025-02-05 20:28:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:28:12" (2/3) ... [2025-02-05 20:28:19,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751fb5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:28:19, skipping insertion in model container [2025-02-05 20:28:19,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:28:19" (3/3) ... [2025-02-05 20:28:19,568 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-93.i [2025-02-05 20:28:19,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:28:19,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-93.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:28:19,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:28:19,634 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;@71a139b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:28:19,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:28:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:28:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:28:19,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:19,647 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:19,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1483420550, now seen corresponding path program 1 times [2025-02-05 20:28:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:28:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615687967] [2025-02-05 20:28:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:19,659 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-05 20:28:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:28:19,662 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-05 20:28:19,664 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-05 20:28:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:28:20,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:28:20,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:20,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:20,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:28:20,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:28:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2025-02-05 20:28:20,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:28:20,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:28:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615687967] [2025-02-05 20:28:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615687967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:28:20,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:28:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:28:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744810725] [2025-02-05 20:28:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:28:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:28:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:28:20,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:28:20,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:28:20,066 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:28:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:28:20,082 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2025-02-05 20:28:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:28:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2025-02-05 20:28:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:28:20,088 INFO L225 Difference]: With dead ends: 134 [2025-02-05 20:28:20,088 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 20:28:20,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-05 20:28:20,092 INFO L435 NwaCegarLoop]: 103 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, 103 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-05 20:28:20,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:28:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 20:28:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-05 20:28:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 20:28:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2025-02-05 20:28:20,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 161 [2025-02-05 20:28:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:28:20,119 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2025-02-05 20:28:20,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 20:28:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2025-02-05 20:28:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:28:20,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:20,122 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:20,133 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 (2)] Ended with exit code 0 [2025-02-05 20:28:20,322 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-05 20:28:20,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1310842602, now seen corresponding path program 1 times [2025-02-05 20:28:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:28:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161448372] [2025-02-05 20:28:20,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:20,325 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-05 20:28:20,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:28:20,327 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-05 20:28:20,329 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-05 20:28:20,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:28:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:28:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:20,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 20:28:20,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:28:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 20:28:20,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:28:20,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:28:20,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161448372] [2025-02-05 20:28:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161448372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:28:20,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:28:20,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:28:20,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334770360] [2025-02-05 20:28:20,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:28:20,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:28:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:28:20,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:28:20,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:28:20,695 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:28:24,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:28:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:28:24,865 INFO L93 Difference]: Finished difference Result 160 states and 244 transitions. [2025-02-05 20:28:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:28:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2025-02-05 20:28:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:28:24,921 INFO L225 Difference]: With dead ends: 160 [2025-02-05 20:28:24,921 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 20:28:24,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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-05 20:28:24,922 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:28:24,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 20:28:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 20:28:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-02-05 20:28:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:28:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2025-02-05 20:28:24,947 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 161 [2025-02-05 20:28:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:28:24,947 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2025-02-05 20:28:24,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 20:28:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2025-02-05 20:28:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:28:24,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:28:24,950 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 20:28:24,960 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-05 20:28:25,150 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-05 20:28:25,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:28:25,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:28:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1598340147, now seen corresponding path program 1 times [2025-02-05 20:28:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:28:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665768484] [2025-02-05 20:28:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:28:25,152 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-05 20:28:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:28:25,157 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-05 20:28:25,158 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-05 20:28:25,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:28:25,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:28:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:28:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:28:25,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 20:28:25,571 INFO L279 TraceCheckSpWp]: Computing forward predicates...