./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.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-3.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 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:16:21,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:16:22,024 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:16:22,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:16:22,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:16:22,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:16:22,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:16:22,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:16:22,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:16:22,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:16:22,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:16:22,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:16:22,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:16:22,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:16:22,056 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:16:22,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:16:22,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:16:22,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:16:22,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:22,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:22,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:16:22,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:16:22,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:16:22,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:16:22,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:16:22,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:16:22,060 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 -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2025-01-09 13:16:22,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:16:22,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:16:22,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:16:22,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:16:22,310 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:16:22,312 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-3.i [2025-01-09 13:16:23,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2574be982/775b0e35034848f890dd18318163d8a2/FLAG0414a134e [2025-01-09 13:16:23,881 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:16:23,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2025-01-09 13:16:23,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2574be982/775b0e35034848f890dd18318163d8a2/FLAG0414a134e [2025-01-09 13:16:24,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2574be982/775b0e35034848f890dd18318163d8a2 [2025-01-09 13:16:24,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:16:24,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:16:24,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:16:24,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:16:24,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:16:24,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67892ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24, skipping insertion in model container [2025-01-09 13:16:24,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:16:24,210 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-3.i[914,927] [2025-01-09 13:16:24,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:16:24,255 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:16:24,271 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-3.i[914,927] [2025-01-09 13:16:24,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:16:24,305 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:16:24,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24 WrapperNode [2025-01-09 13:16:24,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:16:24,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:16:24,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:16:24,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:16:24,312 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:16:24" (1/1) ... [2025-01-09 13:16:24,317 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:16:24" (1/1) ... [2025-01-09 13:16:24,336 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-01-09 13:16:24,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:16:24,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:16:24,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:16:24,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:16:24,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,361 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:16:24,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:16:24,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:16:24,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:16:24,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:16:24,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (1/1) ... [2025-01-09 13:16:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:16:24,403 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:16:24,405 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:16:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:16:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:16:24,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:16:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:16:24,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:16:24,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:16:24,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:16:24,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:16:24,643 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:16:24,643 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:16:24,650 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:16:24,650 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:16:24,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:24 BoogieIcfgContainer [2025-01-09 13:16:24,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:16:24,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:16:24,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:16:24,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:16:24,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:16:24" (1/3) ... [2025-01-09 13:16:24,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bd42b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:24, skipping insertion in model container [2025-01-09 13:16:24,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:24" (2/3) ... [2025-01-09 13:16:24,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bd42b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:24, skipping insertion in model container [2025-01-09 13:16:24,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:24" (3/3) ... [2025-01-09 13:16:24,657 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2025-01-09 13:16:24,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:16:24,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:16:24,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:16:24,720 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;@12ed30d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:16:24,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:16:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:16:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:24,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:24,730 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:24,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash -543394728, now seen corresponding path program 1 times [2025-01-09 13:16:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779168007] [2025-01-09 13:16:24,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:24,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:24,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:24,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 13:16:24,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:24,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779168007] [2025-01-09 13:16:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779168007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:16:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141751153] [2025-01-09 13:16:24,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:24,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:16:24,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:16:24,887 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:16:24,889 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:16:24,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:24,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:24,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:16:24,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 13:16:25,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141751153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:16:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:16:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414021881] [2025-01-09 13:16:25,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:16:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:25,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:16:25,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:16:25,028 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:25,042 INFO L93 Difference]: Finished difference Result 93 states and 150 transitions. [2025-01-09 13:16:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:16:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-01-09 13:16:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:25,047 INFO L225 Difference]: With dead ends: 93 [2025-01-09 13:16:25,047 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 13:16:25,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:25,051 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:25,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:16:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 13:16:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 13:16:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:16:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-01-09 13:16:25,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 97 [2025-01-09 13:16:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-01-09 13:16:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-01-09 13:16:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:25,086 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:16:25,291 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:16:25,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:25,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2100937898, now seen corresponding path program 1 times [2025-01-09 13:16:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294189974] [2025-01-09 13:16:25,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:25,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:25,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:25,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:25,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 13:16:25,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:16:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294189974] [2025-01-09 13:16:25,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294189974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:16:25,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881448791] [2025-01-09 13:16:25,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:16:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:16:25,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:16:25,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:16:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:25,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:25,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:16:25,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 13:16:25,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881448791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:16:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2025-01-09 13:16:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084090791] [2025-01-09 13:16:25,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:25,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:16:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:16:25,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:16:25,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:16:25,913 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:26,193 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2025-01-09 13:16:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:16:26,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-01-09 13:16:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:26,194 INFO L225 Difference]: With dead ends: 121 [2025-01-09 13:16:26,194 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 13:16:26,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:16:26,195 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:26,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 163 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:16:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 13:16:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-01-09 13:16:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:16:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2025-01-09 13:16:26,208 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 97 [2025-01-09 13:16:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:26,208 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2025-01-09 13:16:26,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2025-01-09 13:16:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:26,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:26,209 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:16:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:16:26,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1420879528, now seen corresponding path program 1 times [2025-01-09 13:16:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:16:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700772568] [2025-01-09 13:16:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:16:26,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:26,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:26,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:26,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:16:26,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:16:26,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:26,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:26,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:26,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:16:26,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:16:26,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:16:26,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:16:26,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:16:26,551 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:16:26,587 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:16:26,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:16:26 BoogieIcfgContainer [2025-01-09 13:16:26,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:16:26,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:16:26,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:16:26,590 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:16:26,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:24" (3/4) ... [2025-01-09 13:16:26,595 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:16:26,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:16:26,595 INFO L158 Benchmark]: Toolchain (without parser) took 2471.40ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 104.3MB in the end (delta: 25.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2025-01-09 13:16:26,596 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:26,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.39ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 117.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:16:26,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:16:26,596 INFO L158 Benchmark]: Boogie Preprocessor took 29.41ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 113.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:26,597 INFO L158 Benchmark]: RCFGBuilder took 278.76ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 98.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:16:26,597 INFO L158 Benchmark]: TraceAbstraction took 1937.24ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 105.3MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:26,600 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:16:26,601 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.30ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.39ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 117.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.31ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.41ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 113.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.76ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 98.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1937.24ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 105.3MB in the end (delta: -7.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 41.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 someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 7.25; [L33] unsigned char var_1_14 = 1; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L93] isInitial = 1 [L94] FCALL initially() [L95] int k_loop; [L96] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L96] COND TRUE k_loop < 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] var_1_7 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L71] var_1_8 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L74] var_1_9 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L75] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L78] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L81] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L98] RET updateVariables() [L99] CALL step() [L38] var_1_12 = var_1_13 [L39] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L40] COND FALSE !(! var_1_14) [L43] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L45] signed long int stepLocal_2 = var_1_7; [L46] signed long int stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_1=536870912, stepLocal_2=1073741821, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L47] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L54] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L99] RET step() [L100] CALL, EXPR property() [L89-L90] return (((((! var_1_11) ? ((var_1_11 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_14) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_14 || (! var_1_5))))) : 1)) && (var_1_12 == ((double) var_1_13))) && (var_1_14 == ((unsigned char) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 133 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 15, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 466 SizeOfPredicates, 1 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1649/1680 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:16:26,613 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-3.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 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:16:28,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:16:28,584 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:16:28,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:16:28,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:16:28,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:16:28,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:16:28,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:16:28,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:16:28,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:16:28,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:16:28,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:16:28,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:16:28,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:16:28,615 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:16:28,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:16:28,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:16:28,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:16:28,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:16:28,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:28,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:16:28,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:16:28,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:16:28,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:16:28,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:28,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:16:28,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:16:28,620 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 -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2025-01-09 13:16:28,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:16:28,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:16:28,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:16:28,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:16:28,841 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:16:28,842 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-3.i [2025-01-09 13:16:30,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93b552790/2c2a6255a14645f4bdf987d19f9fd33f/FLAGf64a33a7c [2025-01-09 13:16:30,291 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:16:30,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2025-01-09 13:16:30,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93b552790/2c2a6255a14645f4bdf987d19f9fd33f/FLAGf64a33a7c [2025-01-09 13:16:30,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93b552790/2c2a6255a14645f4bdf987d19f9fd33f [2025-01-09 13:16:30,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:16:30,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:16:30,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:16:30,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:16:30,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:16:30,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30, skipping insertion in model container [2025-01-09 13:16:30,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:16:30,801 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-3.i[914,927] [2025-01-09 13:16:30,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:16:30,839 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:16:30,846 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-3.i[914,927] [2025-01-09 13:16:30,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:16:30,893 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:16:30,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30 WrapperNode [2025-01-09 13:16:30,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:16:30,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:16:30,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:16:30,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:16:30,904 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:16:30" (1/1) ... [2025-01-09 13:16:30,919 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:16:30" (1/1) ... [2025-01-09 13:16:30,936 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-01-09 13:16:30,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:16:30,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:16:30,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:16:30,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:16:30,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,966 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:16:30,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:16:30,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:16:30,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:16:30,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:16:30,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (1/1) ... [2025-01-09 13:16:30,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:16:31,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:16:31,014 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:16:31,017 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:16:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:16:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:16:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:16:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:16:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:16:31,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:16:31,085 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:16:31,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:16:31,254 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 13:16:31,254 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:16:31,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:16:31,261 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:16:31,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:31 BoogieIcfgContainer [2025-01-09 13:16:31,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:16:31,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:16:31,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:16:31,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:16:31,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:16:30" (1/3) ... [2025-01-09 13:16:31,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270a487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:31, skipping insertion in model container [2025-01-09 13:16:31,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:16:30" (2/3) ... [2025-01-09 13:16:31,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270a487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:16:31, skipping insertion in model container [2025-01-09 13:16:31,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:16:31" (3/3) ... [2025-01-09 13:16:31,268 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2025-01-09 13:16:31,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:16:31,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:16:31,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:16:31,336 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;@10cca29d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:16:31,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:16:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:16:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:31,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:31,350 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:31,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash -543394728, now seen corresponding path program 1 times [2025-01-09 13:16:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186627391] [2025-01-09 13:16:31,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:31,385 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:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:31,391 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:31,394 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:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:31,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:31,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:16:31,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-01-09 13:16:31,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:31,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:16:31,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186627391] [2025-01-09 13:16:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186627391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:16:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803860745] [2025-01-09 13:16:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:31,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:16:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:16:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:16:31,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:16:31,584 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:31,598 INFO L93 Difference]: Finished difference Result 93 states and 150 transitions. [2025-01-09 13:16:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:16:31,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-01-09 13:16:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:31,603 INFO L225 Difference]: With dead ends: 93 [2025-01-09 13:16:31,603 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 13:16:31,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:31,608 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:31,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:16:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 13:16:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 13:16:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 13:16:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2025-01-09 13:16:31,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 97 [2025-01-09 13:16:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2025-01-09 13:16:31,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2025-01-09 13:16:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:31,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:31,643 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,649 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:31,843 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:31,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2100937898, now seen corresponding path program 1 times [2025-01-09 13:16:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328328179] [2025-01-09 13:16:31,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:31,846 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:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:31,848 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:31,850 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:31,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:31,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:16:31,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:16:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 13:16:32,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:16:32,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:16:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328328179] [2025-01-09 13:16:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328328179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:16:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:16:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 13:16:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829337523] [2025-01-09 13:16:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:16:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 13:16:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:16:32,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 13:16:32,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 13:16:32,041 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:16:32,464 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2025-01-09 13:16:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:16:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2025-01-09 13:16:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:16:32,465 INFO L225 Difference]: With dead ends: 121 [2025-01-09 13:16:32,466 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 13:16:32,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:16:32,467 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:16:32,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 197 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:16:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 13:16:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2025-01-09 13:16:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:16:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2025-01-09 13:16:32,479 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 97 [2025-01-09 13:16:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:16:32,479 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2025-01-09 13:16:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 13:16:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2025-01-09 13:16:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:16:32,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:16:32,481 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,486 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:32,682 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:32,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:16:32,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:16:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1420879528, now seen corresponding path program 1 times [2025-01-09 13:16:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:16:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989558909] [2025-01-09 13:16:32,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:16:32,684 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:32,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:16:32,686 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:32,688 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:32,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:16:32,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:16:32,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:16:32,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:16:32,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 13:16:32,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:17:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 157 proven. 128 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-09 13:17:43,835 INFO L312 TraceCheckSpWp]: Computing backward predicates...