./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:30:01,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:30:01,448 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:30:01,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:30:01,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:30:01,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:30:01,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:30:01,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:30:01,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:30:01,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:30:01,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:30:01,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:30:01,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:30:01,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:30:01,470 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:30:01,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:30:01,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:30:01,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:30:01,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:30:01,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:30:01,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:30:01,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:30:01,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:30:01,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:30:01,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:30:01,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:30:01,474 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-01-09 08:30:01,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:30:01,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:30:01,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:30:01,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:30:01,728 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:30:01,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-01-09 08:30:02,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4bb85b8/a2fc4ce43748488486f09a91590c290b/FLAG7a4d6121d [2025-01-09 08:30:03,231 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:30:03,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-01-09 08:30:03,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4bb85b8/a2fc4ce43748488486f09a91590c290b/FLAG7a4d6121d [2025-01-09 08:30:03,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4bb85b8/a2fc4ce43748488486f09a91590c290b [2025-01-09 08:30:03,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:30:03,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:30:03,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:30:03,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:30:03,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:30:03,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8e782a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03, skipping insertion in model container [2025-01-09 08:30:03,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:30:03,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-01-09 08:30:03,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:30:03,443 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:30:03,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-01-09 08:30:03,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:30:03,482 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:30:03,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03 WrapperNode [2025-01-09 08:30:03,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:30:03,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:30:03,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:30:03,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:30:03,487 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:30:03" (1/1) ... [2025-01-09 08:30:03,494 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:30:03" (1/1) ... [2025-01-09 08:30:03,516 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 08:30:03,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:30:03,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:30:03,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:30:03,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:30:03,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,541 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:30:03,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:30:03,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:30:03,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:30:03,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:30:03,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (1/1) ... [2025-01-09 08:30:03,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:30:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:30:03,582 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:30:03,593 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:30:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:30:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:30:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:30:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:30:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:30:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:30:03,652 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:30:03,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:30:03,895 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:30:03,895 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:30:03,906 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:30:03,907 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:30:03,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:30:03 BoogieIcfgContainer [2025-01-09 08:30:03,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:30:03,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:30:03,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:30:03,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:30:03,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:30:03" (1/3) ... [2025-01-09 08:30:03,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739dae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:30:03, skipping insertion in model container [2025-01-09 08:30:03,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:30:03" (2/3) ... [2025-01-09 08:30:03,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739dae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:30:03, skipping insertion in model container [2025-01-09 08:30:03,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:30:03" (3/3) ... [2025-01-09 08:30:03,917 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2025-01-09 08:30:03,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:30:03,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-59.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:30:03,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:30:03,988 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;@65a62393, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:30:03,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:30:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 08:30:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:30:03,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:30:04,000 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:04,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:30:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:30:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1387526573, now seen corresponding path program 1 times [2025-01-09 08:30:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:30:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879421015] [2025-01-09 08:30:04,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:30:04,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:30:04,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:30:04,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:04,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:30:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 08:30:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:30:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879421015] [2025-01-09 08:30:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879421015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:30:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644400530] [2025-01-09 08:30:04,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:04,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:30:04,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:30:04,185 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:30:04,187 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:30:04,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:30:04,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:30:04,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:04,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:30:04,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:30:04,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:30:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 08:30:04,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:30:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644400530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:30:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:30:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:30:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66485037] [2025-01-09 08:30:04,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:30:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:30:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:30:04,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:30:04,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:30:04,337 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 08:30:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:30:04,350 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-01-09 08:30:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:30:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-01-09 08:30:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:30:04,355 INFO L225 Difference]: With dead ends: 96 [2025-01-09 08:30:04,355 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 08:30:04,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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:30:04,359 INFO L435 NwaCegarLoop]: 71 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, 71 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:30:04,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:30:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 08:30:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 08:30:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 08:30:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-01-09 08:30:04,385 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2025-01-09 08:30:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:30:04,385 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-01-09 08:30:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 08:30:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-01-09 08:30:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:30:04,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:30:04,391 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:04,403 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:30:04,592 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:30:04,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:30:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:30:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1271250677, now seen corresponding path program 1 times [2025-01-09 08:30:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:30:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918593697] [2025-01-09 08:30:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:30:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:30:04,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:30:04,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:04,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:30:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 08:30:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:30:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918593697] [2025-01-09 08:30:04,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918593697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:30:04,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:30:04,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:30:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103076044] [2025-01-09 08:30:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:30:04,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:30:04,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:30:04,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:30:04,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:30:04,978 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:30:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:30:05,104 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-01-09 08:30:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:30:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 08:30:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:30:05,106 INFO L225 Difference]: With dead ends: 139 [2025-01-09 08:30:05,106 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 08:30:05,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:30:05,107 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:30:05,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:30:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 08:30:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-01-09 08:30:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:30:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2025-01-09 08:30:05,128 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2025-01-09 08:30:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:30:05,129 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2025-01-09 08:30:05,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:30:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2025-01-09 08:30:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:30:05,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:30:05,130 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:30:05,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:30:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:30:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -770923884, now seen corresponding path program 1 times [2025-01-09 08:30:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:30:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878817971] [2025-01-09 08:30:05,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:30:05,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:30:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:30:05,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:05,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:30:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 08:30:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:30:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878817971] [2025-01-09 08:30:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878817971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:30:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:30:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:30:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6043652] [2025-01-09 08:30:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:30:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:30:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:30:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:30:05,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:30:05,314 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:30:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:30:05,484 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2025-01-09 08:30:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:30:05,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-01-09 08:30:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:30:05,487 INFO L225 Difference]: With dead ends: 176 [2025-01-09 08:30:05,487 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 08:30:05,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:30:05,488 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:30:05,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 253 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:30:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 08:30:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2025-01-09 08:30:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:30:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-01-09 08:30:05,501 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2025-01-09 08:30:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:30:05,501 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-01-09 08:30:05,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:30:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-01-09 08:30:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 08:30:05,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:30:05,503 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:30:05,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:30:05,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:30:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1051514145, now seen corresponding path program 1 times [2025-01-09 08:30:05,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:30:05,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286503968] [2025-01-09 08:30:05,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:30:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 08:30:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 08:30:05,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:05,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:30:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109235611] [2025-01-09 08:30:05,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:30:05,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:30:05,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:30:05,588 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:30:05,590 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:30:05,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 08:30:05,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 08:30:05,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:30:05,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:30:05,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 08:30:05,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:30:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 08:30:07,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:30:24,290 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 08:30:30,750 WARN L286 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:30:42,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod c_~var_1_17~0 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse3) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse4 v_z_5) (< v_z_5 .cse1))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-01-09 08:30:51,645 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:30:56,833 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:31:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:31:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286503968] [2025-01-09 08:31:20,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 08:31:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109235611] [2025-01-09 08:31:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109235611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:31:20,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:31:20,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-01-09 08:31:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819084118] [2025-01-09 08:31:20,126 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 08:31:20,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 08:31:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:31:20,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 08:31:20,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=508, Unknown=1, NotChecked=50, Total=756 [2025-01-09 08:31:20,129 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 08:31:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:31:22,324 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2025-01-09 08:31:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 08:31:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 95 [2025-01-09 08:31:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:31:22,326 INFO L225 Difference]: With dead ends: 299 [2025-01-09 08:31:22,326 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 08:31:22,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=313, Invalid=812, Unknown=1, NotChecked=64, Total=1190 [2025-01-09 08:31:22,328 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:31:22,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 293 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:31:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 08:31:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2025-01-09 08:31:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.134453781512605) internal successors, (135), 119 states have internal predecessors, (135), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:31:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2025-01-09 08:31:22,367 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 95 [2025-01-09 08:31:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:31:22,367 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2025-01-09 08:31:22,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 08:31:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2025-01-09 08:31:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 08:31:22,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:31:22,368 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:22,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:31:22,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:31:22,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:31:22,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:31:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1527239591, now seen corresponding path program 1 times [2025-01-09 08:31:22,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:31:22,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318599449] [2025-01-09 08:31:22,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:31:22,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 08:31:22,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 08:31:22,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:22,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:31:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526410360] [2025-01-09 08:31:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:22,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:31:22,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:31:22,675 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:31:22,679 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:31:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 08:31:23,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 08:31:23,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:23,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:31:23,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:31:23,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 08:31:23,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 08:31:23,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:31:23,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:31:23,267 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:31:23,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:31:23,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:31:23,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:31:23,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 08:31:23,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:31:23,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:31:23 BoogieIcfgContainer [2025-01-09 08:31:23,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:31:23,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:31:23,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:31:23,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:31:23,532 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:30:03" (3/4) ... [2025-01-09 08:31:23,533 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:31:23,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:31:23,534 INFO L158 Benchmark]: Toolchain (without parser) took 80273.60ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 111.0MB in the beginning and 211.3MB in the end (delta: -100.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.87ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: Boogie Preprocessor took 38.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: RCFGBuilder took 352.21ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 67.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:31:23,535 INFO L158 Benchmark]: TraceAbstraction took 79622.13ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 66.2MB in the beginning and 211.4MB in the end (delta: -145.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:31:23,536 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 285.2MB. Free memory was 211.4MB in the beginning and 211.3MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:31:23,537 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.32ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.87ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 97.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 93.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 352.21ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 67.3MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 79622.13ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 66.2MB in the beginning and 211.4MB in the end (delta: -145.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 285.2MB. Free memory was 211.4MB in the beginning and 211.3MB in the end (delta: 87.7kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_4 = 25; [L24] unsigned short int var_1_5 = 0; [L25] unsigned short int var_1_6 = 62100; [L26] unsigned short int var_1_7 = 27651; [L27] double var_1_8 = 128.9; [L28] double var_1_10 = 16.5; [L29] double var_1_11 = 25.5; [L30] double var_1_12 = 199.75; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 1; [L35] unsigned short int var_1_17 = 32; [L36] unsigned char var_1_18 = 1; [L37] unsigned long int var_1_19 = 1; [L38] unsigned short int last_1_var_1_5 = 0; [L39] unsigned char last_1_var_1_15 = 1; [L40] unsigned char last_1_var_1_18 = 1; [L41] unsigned long int last_1_var_1_19 = 1; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L127] isInitial = 1 [L128] FCALL initially() [L130] CALL updateLastVariables() [L117] last_1_var_1_5 = var_1_5 [L118] last_1_var_1_15 = var_1_15 [L119] last_1_var_1_18 = var_1_18 [L120] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L97] var_1_6 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L99] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L99] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=27651, var_1_8=1289/10] [L100] var_1_7 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L101] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L102] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L102] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L103] var_1_10 = __VERIFIER_nondet_double() [L104] 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, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L104] 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, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L105] var_1_11 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L107] var_1_12 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L109] var_1_14 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L110] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L111] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L111] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L113] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L114] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L114] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE \read(last_1_var_1_18) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=1289/10] [L46] COND TRUE (! last_1_var_1_15) || (last_1_var_1_19 < var_1_6) [L47] var_1_8 = ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L54] COND TRUE var_1_12 != var_1_8 [L55] var_1_15 = (! var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L59] var_1_17 = var_1_4 [L60] var_1_18 = var_1_16 [L61] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=1, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L62] COND FALSE !((var_1_17 != (16 / var_1_4)) && var_1_15) [L73] var_1_1 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L75] COND FALSE !(var_1_17 < last_1_var_1_5) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=0, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L78] COND TRUE ! var_1_15 [L79] var_1_5 = ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L82] COND TRUE var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L83] COND TRUE var_1_5 <= var_1_6 [L84] var_1_13 = 32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_17 != (16 / var_1_4)) && var_1_15) ? ((var_1_17 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_17))) : (var_1_15 ? (var_1_1 == ((unsigned short int) var_1_17)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_17))) && ((var_1_17 < last_1_var_1_5) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - last_1_var_1_5)))) : ((! var_1_15) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))))) : 1))) && (last_1_var_1_18 ? (((! last_1_var_1_15) || (last_1_var_1_19 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19))))) ? ((var_1_5 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=2, var_1_18=1, var_1_19=2, var_1_1=2, var_1_4=2, var_1_5=16649, var_1_6=32771, var_1_7=16647, var_1_8=509/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.5s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 261 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 74.8s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2243 SizeOfPredicates, 8 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1689/1820 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:31:23,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:31:25,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:31:25,567 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:31:25,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:31:25,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:31:25,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:31:25,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:31:25,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:31:25,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:31:25,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:31:25,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:31:25,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:31:25,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:31:25,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:31:25,589 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:31:25,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:31:25,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:31:25,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:31:25,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:31:25,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:31:25,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:31:25,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:31:25,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:31:25,593 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-01-09 08:31:25,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:31:25,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:31:25,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:31:25,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:31:25,860 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:31:25,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-01-09 08:31:27,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817480500/67857d2c61554dc9ac7e5dc893547902/FLAG16d65f606 [2025-01-09 08:31:27,299 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:31:27,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-01-09 08:31:27,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817480500/67857d2c61554dc9ac7e5dc893547902/FLAG16d65f606 [2025-01-09 08:31:27,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817480500/67857d2c61554dc9ac7e5dc893547902 [2025-01-09 08:31:27,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:31:27,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:31:27,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:31:27,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:31:27,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:31:27,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a98934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27, skipping insertion in model container [2025-01-09 08:31:27,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:31:27,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-01-09 08:31:27,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:31:27,523 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:31:27,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i[919,932] [2025-01-09 08:31:27,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:31:27,575 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:31:27,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27 WrapperNode [2025-01-09 08:31:27,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:31:27,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:31:27,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:31:27,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:31:27,583 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:31:27" (1/1) ... [2025-01-09 08:31:27,595 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:31:27" (1/1) ... [2025-01-09 08:31:27,617 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 08:31:27,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:31:27,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:31:27,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:31:27,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:31:27,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,642 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:31:27,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:31:27,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:31:27,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:31:27,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:31:27,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (1/1) ... [2025-01-09 08:31:27,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:31:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:31:27,698 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:31:27,707 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:31:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:31:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:31:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:31:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:31:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:31:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:31:27,787 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:31:27,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:31:28,544 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:31:28,544 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:31:28,559 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:31:28,559 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:31:28,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:31:28 BoogieIcfgContainer [2025-01-09 08:31:28,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:31:28,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:31:28,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:31:28,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:31:28,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:31:27" (1/3) ... [2025-01-09 08:31:28,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c04fa41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:31:28, skipping insertion in model container [2025-01-09 08:31:28,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:27" (2/3) ... [2025-01-09 08:31:28,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c04fa41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:31:28, skipping insertion in model container [2025-01-09 08:31:28,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:31:28" (3/3) ... [2025-01-09 08:31:28,568 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2025-01-09 08:31:28,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:31:28,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-59.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:31:28,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:31:28,629 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;@1f2c212e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:31:28,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:31:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 08:31:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:31:28,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:31:28,643 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:28,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:31:28,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:31:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1387526573, now seen corresponding path program 1 times [2025-01-09 08:31:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:31:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527115931] [2025-01-09 08:31:28,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:28,662 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:31:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:31:28,668 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:31:28,669 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:31:28,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:31:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:31:28,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:31:28,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:31:28,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:31:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 08:31:28,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:31:28,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:31:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527115931] [2025-01-09 08:31:28,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527115931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:31:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:31:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:31:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953597427] [2025-01-09 08:31:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:31:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:31:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:31:28,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:31:28,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:31:28,940 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:31:28,958 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-01-09 08:31:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:31:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 08:31:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:31:28,964 INFO L225 Difference]: With dead ends: 96 [2025-01-09 08:31:28,964 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 08:31:28,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:31:28,970 INFO L435 NwaCegarLoop]: 71 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, 71 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:31:28,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:31:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 08:31:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 08:31:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 08:31:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-01-09 08:31:29,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2025-01-09 08:31:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:31:29,002 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-01-09 08:31:29,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-01-09 08:31:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 08:31:29,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:31:29,011 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:29,021 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:31:29,217 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:31:29,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:31:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:31:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1271250677, now seen corresponding path program 1 times [2025-01-09 08:31:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:31:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210068086] [2025-01-09 08:31:29,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:29,219 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:31:29,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:31:29,221 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:31:29,223 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:31:29,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 08:31:29,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 08:31:29,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:29,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:31:29,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 08:31:29,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:31:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 08:31:29,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:31:29,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:31:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210068086] [2025-01-09 08:31:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210068086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:31:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:31:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:31:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820649186] [2025-01-09 08:31:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:31:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:31:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:31:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:31:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:31:29,672 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:31:30,364 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-01-09 08:31:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:31:30,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 08:31:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:31:30,377 INFO L225 Difference]: With dead ends: 139 [2025-01-09 08:31:30,377 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 08:31:30,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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:31:30,378 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:31:30,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 197 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:31:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 08:31:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-01-09 08:31:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:31:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2025-01-09 08:31:30,392 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2025-01-09 08:31:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:31:30,392 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2025-01-09 08:31:30,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2025-01-09 08:31:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 08:31:30,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:31:30,394 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:30,403 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:31:30,599 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:31:30,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:31:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:31:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash -770923884, now seen corresponding path program 1 times [2025-01-09 08:31:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:31:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877215496] [2025-01-09 08:31:30,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:30,604 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:31:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:31:30,609 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:31:30,610 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:31:30,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 08:31:30,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 08:31:30,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:31:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 08:31:30,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:31:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 08:31:30,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:31:30,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:31:30,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877215496] [2025-01-09 08:31:30,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877215496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:31:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:31:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:31:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092061038] [2025-01-09 08:31:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:31:30,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:31:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:31:30,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:31:30,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:31:30,979 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:31:31,969 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2025-01-09 08:31:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:31:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-01-09 08:31:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:31:31,982 INFO L225 Difference]: With dead ends: 176 [2025-01-09 08:31:31,982 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 08:31:31,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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:31:31,983 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:31:31,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 08:31:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 08:31:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2025-01-09 08:31:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:31:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-01-09 08:31:32,033 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2025-01-09 08:31:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:31:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-01-09 08:31:32,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 08:31:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-01-09 08:31:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 08:31:32,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:31:32,035 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:32,044 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 (4)] Ended with exit code 0 [2025-01-09 08:31:32,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:31:32,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:31:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:31:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1051514145, now seen corresponding path program 1 times [2025-01-09 08:31:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:31:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957389810] [2025-01-09 08:31:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:31:32,241 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:31:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:31:32,243 INFO L229 MonitoredProcess]: Starting monitored process 5 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:31:32,247 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 (5)] Waiting until timeout for monitored process [2025-01-09 08:31:32,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 08:31:32,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 08:31:32,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:31:32,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:31:32,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 08:31:32,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:31:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 90 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 08:31:34,005 INFO L312 TraceCheckSpWp]: Computing backward predicates...