./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.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_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:15:45,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:15:45,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:15:45,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:15:45,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:15:45,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:15:45,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:15:45,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:15:45,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:15:45,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:15:45,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:15:45,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:15:45,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:15:45,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:15:45,582 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:15:45,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:15:45,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:15:45,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:45,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:45,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:45,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:15:45,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:15:45,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:15:45,586 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-01-09 13:15:45,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:15:45,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:15:45,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:15:45,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:15:45,880 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:15:45,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:15:47,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d90b405a9/01e80d76667a4b6f8749d3be16ec8f05/FLAG14e6d9542 [2025-01-09 13:15:47,372 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:15:47,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:15:47,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d90b405a9/01e80d76667a4b6f8749d3be16ec8f05/FLAG14e6d9542 [2025-01-09 13:15:47,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d90b405a9/01e80d76667a4b6f8749d3be16ec8f05 [2025-01-09 13:15:47,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:15:47,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:15:47,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:47,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:15:47,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:15:47,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e163cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47, skipping insertion in model container [2025-01-09 13:15:47,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:15:47,781 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-01-09 13:15:47,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:47,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:15:47,839 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-01-09 13:15:47,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:47,863 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:15:47,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47 WrapperNode [2025-01-09 13:15:47,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:47,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:47,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:15:47,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:15:47,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,904 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-01-09 13:15:47,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:47,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:15:47,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:15:47,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:15:47,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,933 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 13:15:47,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:15:47,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:15:47,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:15:47,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:15:47,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (1/1) ... [2025-01-09 13:15:47,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:47,991 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 13:15:47,996 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 13:15:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:15:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:15:48,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:15:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:15:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:15:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:15:48,083 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:15:48,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:15:48,226 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:15:48,226 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:15:48,234 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:15:48,235 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:15:48,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:48 BoogieIcfgContainer [2025-01-09 13:15:48,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:15:48,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:15:48,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:15:48,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:15:48,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:15:47" (1/3) ... [2025-01-09 13:15:48,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4a8ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:48, skipping insertion in model container [2025-01-09 13:15:48,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:47" (2/3) ... [2025-01-09 13:15:48,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4a8ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:15:48, skipping insertion in model container [2025-01-09 13:15:48,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:48" (3/3) ... [2025-01-09 13:15:48,243 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:15:48,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:15:48,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:15:48,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:15:48,304 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;@1418918a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:15:48,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:15:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:15:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:15:48,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:48,315 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:15:48,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1037864160, now seen corresponding path program 1 times [2025-01-09 13:15:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134372626] [2025-01-09 13:15:48,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:48,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:48,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:15:48,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:15:48,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:48,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 13:15:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134372626] [2025-01-09 13:15:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134372626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:15:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140160099] [2025-01-09 13:15:48,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:48,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:15:48,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:48,517 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 13:15:48,518 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 13:15:48,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:15:48,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:15:48,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:48,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:48,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:15:48,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 13:15:48,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:15:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140160099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:15:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:15:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940997183] [2025-01-09 13:15:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:48,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:15:48,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:48,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:15:48,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:15:48,685 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 13:15:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:48,706 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-01-09 13:15:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:15:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-01-09 13:15:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:48,712 INFO L225 Difference]: With dead ends: 67 [2025-01-09 13:15:48,712 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 13:15:48,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 13:15:48,717 INFO L435 NwaCegarLoop]: 46 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, 46 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 13:15:48,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 13:15:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 13:15:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:15:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-01-09 13:15:48,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2025-01-09 13:15:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:48,749 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-01-09 13:15:48,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 13:15:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-01-09 13:15:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:15:48,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:48,751 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:15:48,758 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 13:15:48,954 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 13:15:48,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1563787416, now seen corresponding path program 1 times [2025-01-09 13:15:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144679593] [2025-01-09 13:15:48,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:48,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:15:49,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:15:49,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:15:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 13:15:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:15:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144679593] [2025-01-09 13:15:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144679593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:15:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:15:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:15:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088660896] [2025-01-09 13:15:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:15:49,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:15:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:15:49,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:15:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:15:49,085 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 13:15:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:15:49,124 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2025-01-09 13:15:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:15:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-01-09 13:15:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:15:49,126 INFO L225 Difference]: With dead ends: 72 [2025-01-09 13:15:49,126 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:15:49,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:15:49,127 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:15:49,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:15:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:15:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2025-01-09 13:15:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:15:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-09 13:15:49,135 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2025-01-09 13:15:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:15:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-09 13:15:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 13:15:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-09 13:15:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:15:49,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:15:49,139 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:15:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:15:49,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:15:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:15:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash -754440790, now seen corresponding path program 1 times [2025-01-09 13:15:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:15:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075620523] [2025-01-09 13:15:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:15:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:15:49,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:15:49,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:15:49,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:49,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:15:49,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:15:49,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:15:49,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:15:49,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:15:49,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:15:49,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:15:49,279 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:15:49,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:15:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:15:49,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:15:49,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:15:49,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:15:49 BoogieIcfgContainer [2025-01-09 13:15:49,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:15:49,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:15:49,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:15:49,325 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:15:49,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:15:48" (3/4) ... [2025-01-09 13:15:49,327 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:15:49,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:15:49,328 INFO L158 Benchmark]: Toolchain (without parser) took 1672.38ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 47.0MB in the end (delta: 75.9MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 13:15:49,329 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:49,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.51ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:49,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:49,329 INFO L158 Benchmark]: Boogie Preprocessor took 43.51ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:49,330 INFO L158 Benchmark]: RCFGBuilder took 279.89ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 95.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:15:49,330 INFO L158 Benchmark]: TraceAbstraction took 1085.70ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 47.3MB in the end (delta: 47.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 13:15:49,330 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 167.8MB. Free memory was 47.3MB in the beginning and 47.0MB in the end (delta: 313.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:15:49,332 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.23ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.51ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.51ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 279.89ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 95.5MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1085.70ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 47.3MB in the end (delta: 47.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 167.8MB. Free memory was 47.3MB in the beginning and 47.0MB in the end (delta: 313.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 45, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; VAL [isInitial=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L84] RET updateVariables() [L85] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 88 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 170/180 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 13:15:49,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.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 f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:15:51,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:15:51,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:15:51,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:15:51,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:15:51,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:15:51,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:15:51,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:15:51,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:15:51,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:15:51,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:15:51,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:15:51,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:15:51,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:15:51,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:15:51,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:15:51,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:51,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:51,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:15:51,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:15:51,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:51,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:15:51,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:15:51,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:15:51,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:15:51,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:15:51,666 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 -> f0109ea62ddaffea082e52dba5f82b006075477af70d5262772f7db35bf203e0 [2025-01-09 13:15:51,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:15:51,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:15:51,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:15:51,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:15:51,965 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:15:51,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:15:53,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0bf1f383/31842b7a8d164020a2afde7e6caa86cf/FLAG4474f5518 [2025-01-09 13:15:53,491 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:15:53,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:15:53,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0bf1f383/31842b7a8d164020a2afde7e6caa86cf/FLAG4474f5518 [2025-01-09 13:15:53,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0bf1f383/31842b7a8d164020a2afde7e6caa86cf [2025-01-09 13:15:53,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:15:53,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:15:53,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:53,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:15:53,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:15:53,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:53" (1/1) ... [2025-01-09 13:15:53,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5202d885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:53, skipping insertion in model container [2025-01-09 13:15:53,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:15:53" (1/1) ... [2025-01-09 13:15:53,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:15:54,032 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-01-09 13:15:54,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:54,093 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:15:54,104 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2025-01-09 13:15:54,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:15:54,145 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:15:54,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54 WrapperNode [2025-01-09 13:15:54,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:15:54,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:54,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:15:54,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:15:54,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,181 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-01-09 13:15:54,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:15:54,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:15:54,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:15:54,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:15:54,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,202 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 13:15:54,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:15:54,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:15:54,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:15:54,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:15:54,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (1/1) ... [2025-01-09 13:15:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:15:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:15:54,248 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 13:15:54,252 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 13:15:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:15:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:15:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:15:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:15:54,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:15:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:15:54,324 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:15:54,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:16:00,957 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:16:00,958 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:16:00,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:16:00,969 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:16:00,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:00 BoogieIcfgContainer [2025-01-09 13:16:00,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:16:00,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:16:00,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:16:00,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:16:00,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:15:53" (1/3) ... [2025-01-09 13:16:00,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55920e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:00, skipping insertion in model container [2025-01-09 13:16:00,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:15:54" (2/3) ... [2025-01-09 13:16:00,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55920e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:00, skipping insertion in model container [2025-01-09 13:16:00,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:00" (3/3) ... [2025-01-09 13:16:00,981 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2025-01-09 13:16:00,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:16:00,997 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i that has 2 procedures, 35 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:16:01,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:16:01,058 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;@44d5250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:16:01,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:16:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:16:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:16:01,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:01,068 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:16:01,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1037864160, now seen corresponding path program 1 times [2025-01-09 13:16:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47721050] [2025-01-09 13:16:01,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:01,084 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 13:16:01,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:01,086 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 13:16:01,089 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 13:16:01,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:16:01,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:16:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:01,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:16:01,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 13:16:01,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:01,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:16:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47721050] [2025-01-09 13:16:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47721050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:16:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519494082] [2025-01-09 13:16:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:01,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:16:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:16:01,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:16:01,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:16:01,511 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 13:16:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:01,526 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2025-01-09 13:16:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:16:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-01-09 13:16:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:01,532 INFO L225 Difference]: With dead ends: 67 [2025-01-09 13:16:01,533 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 13:16:01,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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 13:16:01,537 INFO L435 NwaCegarLoop]: 46 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, 46 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 13:16:01,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:16:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 13:16:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-09 13:16:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:16:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-01-09 13:16:01,567 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 49 [2025-01-09 13:16:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:01,568 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-01-09 13:16:01,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 13:16:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2025-01-09 13:16:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:16:01,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:01,569 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:16:01,582 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 13:16:01,770 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 13:16:01,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1563787416, now seen corresponding path program 1 times [2025-01-09 13:16:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927889642] [2025-01-09 13:16:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:01,772 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 13:16:01,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:01,774 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 13:16:01,775 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 13:16:01,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:16:02,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:16:02,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:02,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:02,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:16:02,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 13:16:02,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:02,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:16:02,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927889642] [2025-01-09 13:16:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927889642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:02,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:16:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274653531] [2025-01-09 13:16:02,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:02,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:16:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:16:02,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:16:02,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:16:02,199 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 13:16:05,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:16:09,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:16:13,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:16:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:13,387 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2025-01-09 13:16:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:16:13,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2025-01-09 13:16:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:13,390 INFO L225 Difference]: With dead ends: 72 [2025-01-09 13:16:13,390 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:16:13,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:16:13,391 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:13,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2025-01-09 13:16:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:16:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2025-01-09 13:16:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 13:16:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-09 13:16:13,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 49 [2025-01-09 13:16:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:13,398 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-09 13:16:13,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 13:16:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-09 13:16:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 13:16:13,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:13,399 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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 13:16:13,414 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 13:16:13,600 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 13:16:13,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash -754440790, now seen corresponding path program 1 times [2025-01-09 13:16:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961962822] [2025-01-09 13:16:13,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:13,603 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 13:16:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:13,605 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 13:16:13,606 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 13:16:13,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 13:16:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 13:16:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 13:16:14,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:34,817 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:16:40,551 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:16:47,533 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:16:54,309 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:17:01,795 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:17:13,276 WARN L286 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:17:20,294 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:17:28,433 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)