./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.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 bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:45:21,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:45:21,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:45:21,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:45:21,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:45:21,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:45:21,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:45:21,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:45:21,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:45:21,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:45:21,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:45:21,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:45:21,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:45:21,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:45:21,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:45:21,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:21,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:21,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:45:21,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:45:21,308 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 -> bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 [2025-01-09 08:45:21,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:45:21,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:45:21,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:45:21,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:45:21,537 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:45:21,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2025-01-09 08:45:22,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/789670fb2/6ede1006e6e3426da123d577416cdef1/FLAGebc699c36 [2025-01-09 08:45:22,961 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:45:22,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2025-01-09 08:45:22,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/789670fb2/6ede1006e6e3426da123d577416cdef1/FLAGebc699c36 [2025-01-09 08:45:23,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/789670fb2/6ede1006e6e3426da123d577416cdef1 [2025-01-09 08:45:23,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:45:23,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:45:23,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:45:23,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:45:23,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:45:23,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8b9875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23, skipping insertion in model container [2025-01-09 08:45:23,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:45:23,374 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_normal_file-68.i[913,926] [2025-01-09 08:45:23,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:45:23,415 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:45:23,421 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_normal_file-68.i[913,926] [2025-01-09 08:45:23,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:45:23,445 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:45:23,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23 WrapperNode [2025-01-09 08:45:23,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:45:23,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:45:23,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:45:23,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:45:23,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,482 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-01-09 08:45:23,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:45:23,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:45:23,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:45:23,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:45:23,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,513 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:45:23,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:45:23,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:45:23,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:45:23,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:45:23,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (1/1) ... [2025-01-09 08:45:23,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:45:23,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:45:23,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:45:23,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:45:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:45:23,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:45:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:45:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:45:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:45:23,619 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:45:23,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:45:23,831 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 08:45:23,831 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:45:23,840 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:45:23,843 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:45:23,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:45:23 BoogieIcfgContainer [2025-01-09 08:45:23,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:45:23,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:45:23,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:45:23,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:45:23,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:45:23" (1/3) ... [2025-01-09 08:45:23,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a34eb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:45:23, skipping insertion in model container [2025-01-09 08:45:23,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:23" (2/3) ... [2025-01-09 08:45:23,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a34eb85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:45:23, skipping insertion in model container [2025-01-09 08:45:23,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:45:23" (3/3) ... [2025-01-09 08:45:23,854 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-68.i [2025-01-09 08:45:23,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:45:23,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-68.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:45:23,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:45:23,916 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;@160a40ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:45:23,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:45:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 08:45:23,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:23,925 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:23,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 925690998, now seen corresponding path program 1 times [2025-01-09 08:45:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:45:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463814264] [2025-01-09 08:45:23,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:45:23,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 08:45:23,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 08:45:23,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:23,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 08:45:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:45:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463814264] [2025-01-09 08:45:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463814264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:45:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022374827] [2025-01-09 08:45:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:24,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:45:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:45:24,115 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-01-09 08:45:24,116 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-01-09 08:45:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 08:45:24,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 08:45:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:24,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:45:24,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:45:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 08:45:24,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:45:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022374827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:45:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:45:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:45:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063423330] [2025-01-09 08:45:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:45:24,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:45:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:45:24,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:45:24,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:45:24,295 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 08:45:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:45:24,314 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-01-09 08:45:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:45:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-01-09 08:45:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:45:24,319 INFO L225 Difference]: With dead ends: 118 [2025-01-09 08:45:24,319 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 08:45:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-01-09 08:45:24,322 INFO L435 NwaCegarLoop]: 89 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, 89 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-01-09 08:45:24,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:45:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 08:45:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 08:45:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2025-01-09 08:45:24,345 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 107 [2025-01-09 08:45:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:45:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2025-01-09 08:45:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 08:45:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2025-01-09 08:45:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 08:45:24,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:24,348 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:24,354 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-01-09 08:45:24,552 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-01-09 08:45:24,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:24,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1132317780, now seen corresponding path program 1 times [2025-01-09 08:45:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:45:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628645101] [2025-01-09 08:45:24,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:24,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:45:24,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 08:45:24,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 08:45:24,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:24,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 08:45:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:45:24,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628645101] [2025-01-09 08:45:24,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628645101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:45:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472293118] [2025-01-09 08:45:24,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:24,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:45:24,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:45:24,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:45:24,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:45:25,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 08:45:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 08:45:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:25,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 08:45:25,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:45:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-01-09 08:45:25,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:45:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 08:45:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472293118] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:45:25,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:45:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 08:45:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768041544] [2025-01-09 08:45:25,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:45:25,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:45:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:45:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:45:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:45:25,323 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:45:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:45:25,440 INFO L93 Difference]: Finished difference Result 123 states and 182 transitions. [2025-01-09 08:45:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:45:25,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 108 [2025-01-09 08:45:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:45:25,442 INFO L225 Difference]: With dead ends: 123 [2025-01-09 08:45:25,442 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 08:45:25,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:45:25,443 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:45:25,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 160 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:45:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 08:45:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-01-09 08:45:25,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-01-09 08:45:25,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 108 [2025-01-09 08:45:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:45:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-01-09 08:45:25,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:45:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-01-09 08:45:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 08:45:25,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:25,461 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:25,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 08:45:25,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:45:25,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash -739290770, now seen corresponding path program 1 times [2025-01-09 08:45:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:45:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067470042] [2025-01-09 08:45:25,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:25,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:45:25,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 08:45:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 08:45:25,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:25,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 08:45:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:45:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067470042] [2025-01-09 08:45:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067470042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:45:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:45:25,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:45:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693358080] [2025-01-09 08:45:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:45:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:45:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:45:25,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:45:25,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:45:25,901 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 08:45:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:45:25,994 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2025-01-09 08:45:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:45:25,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2025-01-09 08:45:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:45:25,996 INFO L225 Difference]: With dead ends: 127 [2025-01-09 08:45:25,997 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 08:45:25,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:45:25,998 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 105 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:45:25,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 100 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:45:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 08:45:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 08:45:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2025-01-09 08:45:26,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 108 [2025-01-09 08:45:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:45:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2025-01-09 08:45:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 08:45:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2025-01-09 08:45:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 08:45:26,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:26,013 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:45:26,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:26,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1584561457, now seen corresponding path program 1 times [2025-01-09 08:45:26,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:45:26,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647372187] [2025-01-09 08:45:26,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:26,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:45:26,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 08:45:26,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 08:45:26,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:26,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:45:26,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385252338] [2025-01-09 08:45:26,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:26,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:45:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:45:26,088 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:45:26,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:45:26,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 08:45:26,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 08:45:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:26,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:45:26,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:45:26,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 08:45:26,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 08:45:26,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:45:26,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:45:26,235 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:45:26,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:45:26,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:45:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:45:26,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 08:45:26,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:45:26,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:45:26 BoogieIcfgContainer [2025-01-09 08:45:26,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:45:26,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:45:26,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:45:26,485 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:45:26,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:45:23" (3/4) ... [2025-01-09 08:45:26,487 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:45:26,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:45:26,488 INFO L158 Benchmark]: Toolchain (without parser) took 3218.23ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 103.8MB in the beginning and 312.0MB in the end (delta: -208.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2025-01-09 08:45:26,489 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:45:26,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.62ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 90.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:45:26,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.42ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:45:26,489 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 81.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:45:26,489 INFO L158 Benchmark]: RCFGBuilder took 316.00ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 59.6MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:45:26,490 INFO L158 Benchmark]: TraceAbstraction took 2640.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 58.7MB in the beginning and 313.2MB in the end (delta: -254.5MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-01-09 08:45:26,490 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 427.8MB. Free memory was 313.2MB in the beginning and 312.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:45:26,491 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 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.62ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 90.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.42ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 81.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 316.00ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 59.6MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2640.30ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 58.7MB in the beginning and 313.2MB in the end (delta: -254.5MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 427.8MB. Free memory was 313.2MB in the beginning and 312.0MB in the end (delta: 1.2MB). 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 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 10; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 16; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 32; [L30] double var_1_9 = 4.6; [L31] double var_1_10 = 9.25; [L32] double var_1_11 = 1.25; [L33] unsigned char var_1_12 = 100; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_14 = 0; [L36] float var_1_15 = 7.5; [L37] signed long int var_1_16 = 0; VAL [isInitial=0, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=10, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L115] isInitial = 1 [L116] FCALL initially() [L118] FCALL updateLastVariables() [L119] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L85] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L85] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L88] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L88] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L101] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L101] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L102] var_1_10 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L103] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L104] var_1_13 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L105] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L106] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L106] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L119] RET updateVariables() [L120] CALL step() [L41] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L41] COND TRUE var_1_2 <= (var_1_3 ^ var_1_4) [L42] var_1_1 = (! var_1_5) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L46] COND FALSE !(-256 >= var_1_3) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L49] COND TRUE (var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1) [L50] var_1_6 = var_1_7 VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=23/5] [L53] COND TRUE ((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8) [L54] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L56] COND TRUE (var_1_7 && var_1_1) || (! var_1_5) [L57] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L59] COND TRUE \read(var_1_1) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L60] COND FALSE !(var_1_10 >= (- var_1_9)) [L67] var_1_12 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L72] COND FALSE !((var_1_13 % (5u + 256u)) <= var_1_2) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L79] var_1_15 = var_1_10 [L80] var_1_16 = var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L111-L112] return ((((((((var_1_2 <= (var_1_3 ^ var_1_4)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_3) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_1) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (var_1_1 ? ((var_1_10 >= (- var_1_9)) ? ((var_1_8 != var_1_3) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_2) ? (((var_1_13 + 16) >= var_1_2) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) var_1_3)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=256, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 235 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, InterpolantAutomatonStates: 16, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 1123 SizeOfPredicates, 1 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2778/2880 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-01-09 08:45:26,513 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_normal_file-68.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 bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:45:28,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:45:28,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:45:28,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:45:28,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:45:28,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:45:28,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:45:28,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:45:28,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:45:28,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:45:28,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:45:28,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:45:28,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:28,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:45:28,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:28,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:45:28,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:45:28,578 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 -> bdb04820b0552f240cac64f9b4eeb39d6636c8d16d50737ca938c89bab3fc009 [2025-01-09 08:45:28,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:45:28,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:45:28,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:45:28,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:45:28,831 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:45:28,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2025-01-09 08:45:29,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dec750bbf/278e141e342349b0b9d7da74724ecfb9/FLAGb0c92810a [2025-01-09 08:45:30,193 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:45:30,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-68.i [2025-01-09 08:45:30,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dec750bbf/278e141e342349b0b9d7da74724ecfb9/FLAGb0c92810a [2025-01-09 08:45:30,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dec750bbf/278e141e342349b0b9d7da74724ecfb9 [2025-01-09 08:45:30,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:45:30,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:45:30,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:45:30,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:45:30,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:45:30,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70acd32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30, skipping insertion in model container [2025-01-09 08:45:30,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:45:30,705 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_normal_file-68.i[913,926] [2025-01-09 08:45:30,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:45:30,766 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:45:30,775 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_normal_file-68.i[913,926] [2025-01-09 08:45:30,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:45:30,802 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:45:30,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30 WrapperNode [2025-01-09 08:45:30,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:45:30,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:45:30,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:45:30,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:45:30,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,828 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-01-09 08:45:30,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:45:30,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:45:30,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:45:30,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:45:30,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,852 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:45:30,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:45:30,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:45:30,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:45:30,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:45:30,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (1/1) ... [2025-01-09 08:45:30,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:45:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:45:30,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:45:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:45:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:45:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:45:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:45:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:45:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:45:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:45:30,997 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:45:30,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:45:31,401 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:45:31,401 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:45:31,411 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:45:31,412 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:45:31,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:45:31 BoogieIcfgContainer [2025-01-09 08:45:31,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:45:31,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:45:31,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:45:31,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:45:31,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:45:30" (1/3) ... [2025-01-09 08:45:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a32d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:45:31, skipping insertion in model container [2025-01-09 08:45:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:45:30" (2/3) ... [2025-01-09 08:45:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a32d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:45:31, skipping insertion in model container [2025-01-09 08:45:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:45:31" (3/3) ... [2025-01-09 08:45:31,419 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-68.i [2025-01-09 08:45:31,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:45:31,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:45:31,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:45:31,498 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;@4032912d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:45:31,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:45:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 08:45:31,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:31,506 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:31,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:31,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2065794126, now seen corresponding path program 1 times [2025-01-09 08:45:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:45:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874037702] [2025-01-09 08:45:31,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:31,518 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-01-09 08:45:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:45:31,520 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-01-09 08:45:31,521 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-01-09 08:45:31,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 08:45:31,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 08:45:31,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:31,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:31,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:45:31,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:45:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 08:45:31,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:45:31,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:45:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874037702] [2025-01-09 08:45:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874037702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:45:31,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:45:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:45:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160430353] [2025-01-09 08:45:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:45:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:45:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:45:31,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:45:31,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:45:31,703 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 08:45:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:45:31,716 INFO L93 Difference]: Finished difference Result 100 states and 171 transitions. [2025-01-09 08:45:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:45:31,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-01-09 08:45:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:45:31,720 INFO L225 Difference]: With dead ends: 100 [2025-01-09 08:45:31,720 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 08:45:31,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-01-09 08:45:31,724 INFO L435 NwaCegarLoop]: 74 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, 74 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-01-09 08:45:31,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:45:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 08:45:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 08:45:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2025-01-09 08:45:31,745 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 104 [2025-01-09 08:45:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:45:31,745 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2025-01-09 08:45:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 08:45:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2025-01-09 08:45:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 08:45:31,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:31,747 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:31,757 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-01-09 08:45:31,951 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-01-09 08:45:31,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:31,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 46799621, now seen corresponding path program 1 times [2025-01-09 08:45:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:45:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033033683] [2025-01-09 08:45:31,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:31,952 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-01-09 08:45:31,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:45:31,955 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-01-09 08:45:31,956 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-01-09 08:45:31,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 08:45:32,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 08:45:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:32,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 08:45:32,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:45:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-01-09 08:45:32,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:45:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 08:45:32,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:45:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033033683] [2025-01-09 08:45:32,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033033683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:45:32,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:45:32,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-01-09 08:45:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925346184] [2025-01-09 08:45:32,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:45:32,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:45:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:45:32,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:45:32,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:45:32,458 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:45:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:45:32,861 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2025-01-09 08:45:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:45:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 105 [2025-01-09 08:45:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:45:32,870 INFO L225 Difference]: With dead ends: 105 [2025-01-09 08:45:32,870 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 08:45:32,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:45:32,872 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 103 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:45:32,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 107 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:45:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 08:45:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-01-09 08:45:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 08:45:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2025-01-09 08:45:32,895 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 105 [2025-01-09 08:45:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:45:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2025-01-09 08:45:32,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:45:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2025-01-09 08:45:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 08:45:32,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:45:32,905 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:45:32,914 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-01-09 08:45:33,105 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-01-09 08:45:33,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:45:33,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:45:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1960541053, now seen corresponding path program 1 times [2025-01-09 08:45:33,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:45:33,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030744392] [2025-01-09 08:45:33,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:45:33,107 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-01-09 08:45:33,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:45:33,109 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-01-09 08:45:33,111 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-01-09 08:45:33,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 08:45:33,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 08:45:33,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:45:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:45:33,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 08:45:33,234 INFO L279 TraceCheckSpWp]: Computing forward predicates...