./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-79.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_floatingpointinfluence_has-floats_file-79.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 af3efeeaacc64cb7477cce5de730b96d7cb2077214786b6ce63a98322017b054 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:34:50,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:34:50,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:34:50,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:34:50,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:34:50,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:34:50,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:34:50,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:34:50,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:34:50,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:34:50,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:34:50,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:34:50,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:34:50,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:34:50,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:34:50,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:34:50,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:34:50,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:50,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:50,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:34:50,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:34:50,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:34:50,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:34:50,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:34:50,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:34:50,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:34:50,844 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 -> af3efeeaacc64cb7477cce5de730b96d7cb2077214786b6ce63a98322017b054 [2025-01-09 12:34:51,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:34:51,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:34:51,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:34:51,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:34:51,063 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:34:51,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:34:52,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cc7f20d9/5a10007d9cf04912bbf026525147e855/FLAG7a874802c [2025-01-09 12:34:52,430 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:34:52,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:34:52,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cc7f20d9/5a10007d9cf04912bbf026525147e855/FLAG7a874802c [2025-01-09 12:34:52,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7cc7f20d9/5a10007d9cf04912bbf026525147e855 [2025-01-09 12:34:52,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:34:52,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:34:52,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:34:52,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:34:52,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:34:52,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52, skipping insertion in model container [2025-01-09 12:34:52,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:34:52,569 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_floatingpointinfluence_has-floats_file-79.i[917,930] [2025-01-09 12:34:52,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:34:52,615 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:34:52,625 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_floatingpointinfluence_has-floats_file-79.i[917,930] [2025-01-09 12:34:52,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:34:52,659 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:34:52,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52 WrapperNode [2025-01-09 12:34:52,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:34:52,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:34:52,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:34:52,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:34:52,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,690 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-01-09 12:34:52,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:34:52,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:34:52,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:34:52,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:34:52,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,722 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 12:34:52,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:34:52,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:34:52,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:34:52,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:34:52,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (1/1) ... [2025-01-09 12:34:52,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:34:52,771 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 12:34:52,782 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 12:34:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:34:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:34:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:34:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:34:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:34:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:34:52,860 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:34:52,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:34:53,090 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:34:53,090 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:34:53,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:34:53,099 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:34:53,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:34:53 BoogieIcfgContainer [2025-01-09 12:34:53,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:34:53,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:34:53,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:34:53,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:34:53,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:34:52" (1/3) ... [2025-01-09 12:34:53,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cce8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:34:53, skipping insertion in model container [2025-01-09 12:34:53,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:52" (2/3) ... [2025-01-09 12:34:53,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cce8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:34:53, skipping insertion in model container [2025-01-09 12:34:53,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:34:53" (3/3) ... [2025-01-09 12:34:53,109 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:34:53,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:34:53,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-79.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:34:53,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:34:53,179 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;@798a95a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:34:53,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:34:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:34:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 12:34:53,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:34:53,189 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:53,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:34:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:34:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1757754051, now seen corresponding path program 1 times [2025-01-09 12:34:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:34:53,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-01-09 12:34:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:34:53,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:34:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:34:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:34:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 12:34:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:34:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384974312] [2025-01-09 12:34:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384974312] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:34:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609818218] [2025-01-09 12:34:53,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:34:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:34:53,389 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 12:34:53,393 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 12:34:53,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:34:53,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:34:53,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:53,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:34:53,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:34:53,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:34:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 12:34:53,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:34:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609818218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:34:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:34:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:34:53,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360714257] [2025-01-09 12:34:53,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:34:53,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:34:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:34:53,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:34:53,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:34:53,556 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:34:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:34:53,574 INFO L93 Difference]: Finished difference Result 96 states and 150 transitions. [2025-01-09 12:34:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:34:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2025-01-09 12:34:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:34:53,579 INFO L225 Difference]: With dead ends: 96 [2025-01-09 12:34:53,579 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 12:34:53,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 12:34:53,583 INFO L435 NwaCegarLoop]: 67 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, 67 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 12:34:53,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:34:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 12:34:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 12:34:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:34:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2025-01-09 12:34:53,609 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 79 [2025-01-09 12:34:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:34:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2025-01-09 12:34:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:34:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2025-01-09 12:34:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 12:34:53,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:34:53,614 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:53,622 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 12:34:53,815 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 12:34:53,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:34:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:34:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1854702903, now seen corresponding path program 1 times [2025-01-09 12:34:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:34:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546643341] [2025-01-09 12:34:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:34:53,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 12:34:53,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 12:34:53,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:53,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:34:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 12:34:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:34:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546643341] [2025-01-09 12:34:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546643341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:34:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:34:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:34:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598460159] [2025-01-09 12:34:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:34:54,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:34:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:34:54,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:34:54,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:34:54,159 INFO L87 Difference]: Start difference. First operand 48 states and 67 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:34:54,254 INFO L93 Difference]: Finished difference Result 136 states and 191 transitions. [2025-01-09 12:34:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:34:54,255 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 79 [2025-01-09 12:34:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:34:54,256 INFO L225 Difference]: With dead ends: 136 [2025-01-09 12:34:54,256 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 12:34:54,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:34:54,257 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:34:54,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 397 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:34:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 12:34:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 50. [2025-01-09 12:34:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:34:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-01-09 12:34:54,263 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 79 [2025-01-09 12:34:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:34:54,264 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-01-09 12:34:54,264 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-01-09 12:34:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 12:34:54,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:34:54,266 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:54,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:34:54,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:34:54,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:34:54,267 INFO L85 PathProgramCache]: Analyzing trace with hash -715475547, now seen corresponding path program 1 times [2025-01-09 12:34:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:34:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353832246] [2025-01-09 12:34:54,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:34:54,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 12:34:54,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 12:34:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:54,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:34:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 12:34:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:34:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353832246] [2025-01-09 12:34:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353832246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:34:54,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:34:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:34:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361088907] [2025-01-09 12:34:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:34:54,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:34:54,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:34:54,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:34:54,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:34:54,628 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:34:54,793 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2025-01-09 12:34:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:34:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 80 [2025-01-09 12:34:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:34:54,795 INFO L225 Difference]: With dead ends: 140 [2025-01-09 12:34:54,795 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 12:34:54,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:34:54,796 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:34:54,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 352 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:34:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 12:34:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48. [2025-01-09 12:34:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:34:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-01-09 12:34:54,807 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 80 [2025-01-09 12:34:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:34:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-01-09 12:34:54,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-01-09 12:34:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 12:34:54,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:34:54,810 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:34:54,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:34:54,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:34:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash -506518364, now seen corresponding path program 1 times [2025-01-09 12:34:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:34:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248313885] [2025-01-09 12:34:54,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:34:54,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 12:34:54,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 12:34:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:34:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 12:34:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:34:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248313885] [2025-01-09 12:34:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248313885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:34:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:34:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:34:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202532107] [2025-01-09 12:34:55,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:34:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:34:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:34:55,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:34:55,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:34:55,200 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:34:55,304 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2025-01-09 12:34:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:34:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2025-01-09 12:34:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:34:55,306 INFO L225 Difference]: With dead ends: 99 [2025-01-09 12:34:55,306 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 12:34:55,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:34:55,307 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:34:55,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:34:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 12:34:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-01-09 12:34:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:34:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-01-09 12:34:55,317 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 81 [2025-01-09 12:34:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:34:55,318 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-01-09 12:34:55,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:34:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-01-09 12:34:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 12:34:55,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:34:55,320 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:34:55,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:34:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:34:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -925689728, now seen corresponding path program 1 times [2025-01-09 12:34:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:34:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888205672] [2025-01-09 12:34:55,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:34:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:34:55,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:34:55,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:55,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:34:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058267761] [2025-01-09 12:34:55,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:34:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:34:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:34:55,363 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 12:34:55,365 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 12:34:55,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:34:55,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:34:55,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:34:55,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:34:55,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 12:34:55,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 12:34:55,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:34:55,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:34:55,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:34:55,490 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:34:55,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:34:55,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:34:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:34:55,695 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 12:34:55,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:34:55,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:34:55 BoogieIcfgContainer [2025-01-09 12:34:55,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:34:55,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:34:55,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:34:55,744 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:34:55,746 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:34:53" (3/4) ... [2025-01-09 12:34:55,748 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:34:55,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:34:55,749 INFO L158 Benchmark]: Toolchain (without parser) took 3301.08ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 81.2MB in the end (delta: 41.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-01-09 12:34:55,749 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:34:55,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.06ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 110.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:34:55,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:34:55,750 INFO L158 Benchmark]: Boogie Preprocessor took 46.16ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:34:55,750 INFO L158 Benchmark]: RCFGBuilder took 359.59ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 91.0MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:34:55,750 INFO L158 Benchmark]: TraceAbstraction took 2641.60ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 81.3MB in the end (delta: 9.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2025-01-09 12:34:55,750 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:34:55,751 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.19ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.06ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 110.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.16ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 359.59ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 91.0MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2641.60ms. Allocated memory is still 167.8MB. Free memory was 90.3MB in the beginning and 81.3MB in the end (delta: 9.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] double var_1_8 = 32.5; [L28] double var_1_9 = 1.6; [L29] unsigned short int var_1_10 = 32; [L30] float var_1_11 = 15.5; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L92] isInitial = 1 [L93] FCALL initially() [L95] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_9=8/5] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_9=8/5] [L76] var_1_9 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L79] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L82] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L82] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L96] RET updateVariables() [L97] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=-64] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L88] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L88-L89] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 949 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 645 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 304 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 88 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 562 NumberOfCodeBlocks, 562 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1080/1100 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 12:34:55,768 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_floatingpointinfluence_has-floats_file-79.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 af3efeeaacc64cb7477cce5de730b96d7cb2077214786b6ce63a98322017b054 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:34:57,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:34:57,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:34:57,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:34:57,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:34:57,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:34:57,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:34:57,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:34:57,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:34:57,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:34:57,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:34:57,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:34:57,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:34:57,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:34:57,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:57,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:57,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:34:57,783 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:34:57,784 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:34:57,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:34:57,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:34:57,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:34:57,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:34:57,784 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 -> af3efeeaacc64cb7477cce5de730b96d7cb2077214786b6ce63a98322017b054 [2025-01-09 12:34:58,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:34:58,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:34:58,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:34:58,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:34:58,042 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:34:58,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:34:59,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb638bdbe/e97d55ecf58e44eea9f84c95940c7270/FLAG4cff90379 [2025-01-09 12:34:59,406 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:34:59,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:34:59,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb638bdbe/e97d55ecf58e44eea9f84c95940c7270/FLAG4cff90379 [2025-01-09 12:34:59,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb638bdbe/e97d55ecf58e44eea9f84c95940c7270 [2025-01-09 12:34:59,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:34:59,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:34:59,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:34:59,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:34:59,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:34:59,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151b8704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59, skipping insertion in model container [2025-01-09 12:34:59,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:34:59,539 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_floatingpointinfluence_has-floats_file-79.i[917,930] [2025-01-09 12:34:59,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:34:59,597 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:34:59,605 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_floatingpointinfluence_has-floats_file-79.i[917,930] [2025-01-09 12:34:59,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:34:59,643 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:34:59,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59 WrapperNode [2025-01-09 12:34:59,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:34:59,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:34:59,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:34:59,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:34:59,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,680 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-01-09 12:34:59,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:34:59,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:34:59,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:34:59,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:34:59,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,701 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 12:34:59,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:34:59,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:34:59,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:34:59,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:34:59,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (1/1) ... [2025-01-09 12:34:59,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:34:59,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:34:59,750 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 12:34:59,755 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 12:34:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:34:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:34:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:34:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:34:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:34:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:34:59,827 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:34:59,828 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:35:00,145 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:35:00,145 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:35:00,152 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:35:00,153 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:35:00,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:35:00 BoogieIcfgContainer [2025-01-09 12:35:00,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:35:00,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:35:00,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:35:00,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:35:00,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:34:59" (1/3) ... [2025-01-09 12:35:00,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6605621c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:35:00, skipping insertion in model container [2025-01-09 12:35:00,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:34:59" (2/3) ... [2025-01-09 12:35:00,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6605621c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:35:00, skipping insertion in model container [2025-01-09 12:35:00,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:35:00" (3/3) ... [2025-01-09 12:35:00,160 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-79.i [2025-01-09 12:35:00,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:35:00,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-79.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:35:00,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:35:00,210 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;@149a3db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:35:00,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:35:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:35:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 12:35:00,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:35:00,218 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:00,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:35:00,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:35:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 480997047, now seen corresponding path program 1 times [2025-01-09 12:35:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:35:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948229521] [2025-01-09 12:35:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:35:00,229 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 12:35:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:35:00,231 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 12:35:00,233 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 12:35:00,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 12:35:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 12:35:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:35:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:35:00,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:35:00,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:35:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 12:35:00,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:35:00,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:35:00,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948229521] [2025-01-09 12:35:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948229521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:35:00,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:35:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:35:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750380069] [2025-01-09 12:35:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:35:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:35:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:35:00,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:35:00,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:35:00,439 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:35:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:35:00,458 INFO L93 Difference]: Finished difference Result 82 states and 130 transitions. [2025-01-09 12:35:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:35:00,460 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-01-09 12:35:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:35:00,463 INFO L225 Difference]: With dead ends: 82 [2025-01-09 12:35:00,463 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 12:35:00,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 12:35:00,468 INFO L435 NwaCegarLoop]: 57 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, 57 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 12:35:00,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:35:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 12:35:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 12:35:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:35:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-01-09 12:35:00,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 76 [2025-01-09 12:35:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:35:00,498 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-01-09 12:35:00,498 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 12:35:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2025-01-09 12:35:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 12:35:00,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:35:00,499 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:00,505 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 12:35:00,700 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 12:35:00,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:35:00,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:35:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1914934385, now seen corresponding path program 1 times [2025-01-09 12:35:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:35:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587371647] [2025-01-09 12:35:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:35:00,705 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 12:35:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:35:00,707 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 12:35:00,709 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 12:35:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 12:35:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 12:35:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:35:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:35:00,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:35:00,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:35:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 12:35:00,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:35:00,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:35:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587371647] [2025-01-09 12:35:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587371647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:35:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:35:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:35:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833836531] [2025-01-09 12:35:00,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:35:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:35:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:35:00,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:35:00,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:35:00,903 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:35:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:35:01,134 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2025-01-09 12:35:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:35:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2025-01-09 12:35:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:35:01,138 INFO L225 Difference]: With dead ends: 85 [2025-01-09 12:35:01,138 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 12:35:01,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:35:01,139 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:35:01,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 93 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:35:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 12:35:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-01-09 12:35:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 12:35:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-01-09 12:35:01,153 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 76 [2025-01-09 12:35:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:35:01,154 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-01-09 12:35:01,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 12:35:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-01-09 12:35:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 12:35:01,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:35:01,158 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:01,165 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 12:35:01,358 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 12:35:01,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:35:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:35:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1002136516, now seen corresponding path program 1 times [2025-01-09 12:35:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:35:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016314052] [2025-01-09 12:35:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:35:01,361 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 12:35:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:35:01,364 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 12:35:01,365 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 12:35:01,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 12:35:01,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 12:35:01,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:35:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:35:01,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 12:35:01,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:35:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 12:35:44,563 INFO L312 TraceCheckSpWp]: Computing backward predicates...