./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.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-58.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 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:19:55,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:19:55,590 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:19:55,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:19:55,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:19:55,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:19:55,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:19:55,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:19:55,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:19:55,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:19:55,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:19:55,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:19:55,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:19:55,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:19:55,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:19:55,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:55,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:55,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:55,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:19:55,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:19:55,614 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 -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2025-01-09 13:19:55,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:19:55,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:19:55,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:19:55,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:19:55,782 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:19:55,783 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-58.i [2025-01-09 13:19:56,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f111c408e/04536f07c67043b58b5c3c6ffa4a6c6b/FLAGbf49300d4 [2025-01-09 13:19:57,201 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:19:57,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2025-01-09 13:19:57,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f111c408e/04536f07c67043b58b5c3c6ffa4a6c6b/FLAGbf49300d4 [2025-01-09 13:19:57,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f111c408e/04536f07c67043b58b5c3c6ffa4a6c6b [2025-01-09 13:19:57,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:19:57,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:19:57,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:57,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:19:57,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:19:57,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65830e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57, skipping insertion in model container [2025-01-09 13:19:57,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:19:57,378 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-58.i[915,928] [2025-01-09 13:19:57,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:57,421 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:19:57,431 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-58.i[915,928] [2025-01-09 13:19:57,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:19:57,465 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:19:57,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57 WrapperNode [2025-01-09 13:19:57,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:19:57,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:57,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:19:57,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:19:57,471 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:19:57" (1/1) ... [2025-01-09 13:19:57,479 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:19:57" (1/1) ... [2025-01-09 13:19:57,496 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-01-09 13:19:57,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:19:57,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:19:57,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:19:57,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:19:57,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,514 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:19:57,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:19:57,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:19:57,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:19:57,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:19:57,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (1/1) ... [2025-01-09 13:19:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:19:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:57,559 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:19:57,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:19:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:19:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:19:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:19:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:19:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:19:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:19:57,631 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:19:57,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:19:57,838 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:19:57,841 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:19:57,851 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:19:57,855 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:19:57,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:57 BoogieIcfgContainer [2025-01-09 13:19:57,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:19:57,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:19:57,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:19:57,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:19:57,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:19:57" (1/3) ... [2025-01-09 13:19:57,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a846814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:57, skipping insertion in model container [2025-01-09 13:19:57,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:19:57" (2/3) ... [2025-01-09 13:19:57,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a846814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:19:57, skipping insertion in model container [2025-01-09 13:19:57,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:57" (3/3) ... [2025-01-09 13:19:57,864 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2025-01-09 13:19:57,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:19:57,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:19:57,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:19:57,933 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;@131b2895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:19:57,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:19:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:19:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:19:57,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:57,942 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:57,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1395768115, now seen corresponding path program 1 times [2025-01-09 13:19:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934798143] [2025-01-09 13:19:57,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:19:58,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:19:58,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:58,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:19:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:19:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934798143] [2025-01-09 13:19:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934798143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:19:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772370756] [2025-01-09 13:19:58,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:58,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:58,099 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:19:58,107 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:19:58,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:19:58,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:19:58,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:58,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:58,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:19:58,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:19:58,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:19:58,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772370756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:19:58,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:19:58,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:19:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241930721] [2025-01-09 13:19:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:19:58,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:19:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:19:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:19:58,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:19:58,233 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:19:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:19:58,249 INFO L93 Difference]: Finished difference Result 85 states and 135 transitions. [2025-01-09 13:19:58,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:19:58,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-01-09 13:19:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:19:58,254 INFO L225 Difference]: With dead ends: 85 [2025-01-09 13:19:58,255 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 13:19:58,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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:19:58,261 INFO L435 NwaCegarLoop]: 61 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, 61 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:19:58,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:19:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 13:19:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 13:19:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:19:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 13:19:58,303 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-01-09 13:19:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:19:58,303 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 13:19:58,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:19:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 13:19:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:19:58,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:19:58,309 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:58,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:19:58,509 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:19:58,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:19:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:19:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1163316343, now seen corresponding path program 1 times [2025-01-09 13:19:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:19:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793329129] [2025-01-09 13:19:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:19:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:19:58,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:19:58,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:58,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:19:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077902654] [2025-01-09 13:19:58,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:19:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:19:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:19:58,661 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:19:58,662 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:19:58,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:19:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:19:58,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:19:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:19:58,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:19:58,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:19:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 177 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 13:19:59,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:20:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:20:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793329129] [2025-01-09 13:20:00,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:20:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077902654] [2025-01-09 13:20:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077902654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:00,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:20:00,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 13:20:00,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109122162] [2025-01-09 13:20:00,026 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 13:20:00,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:20:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:20:00,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:20:00,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:20:00,028 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 13:20:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:01,651 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2025-01-09 13:20:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 13:20:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-01-09 13:20:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:01,653 INFO L225 Difference]: With dead ends: 137 [2025-01-09 13:20:01,653 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 13:20:01,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 13:20:01,654 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 120 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:20:01,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 260 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:20:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 13:20:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2025-01-09 13:20:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:20:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2025-01-09 13:20:01,665 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 81 [2025-01-09 13:20:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:01,665 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2025-01-09 13:20:01,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 13:20:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2025-01-09 13:20:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:20:01,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:01,667 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:01,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:20:01,871 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:20:01,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:01,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1161469301, now seen corresponding path program 1 times [2025-01-09 13:20:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:20:01,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684273615] [2025-01-09 13:20:01,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:20:01,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:01,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:01,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:01,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:20:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922767849] [2025-01-09 13:20:01,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:01,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:01,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:20:01,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:20:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:01,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:01,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 13:20:01,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 13:20:02,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:20:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:20:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684273615] [2025-01-09 13:20:02,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 13:20:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922767849] [2025-01-09 13:20:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922767849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:20:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 13:20:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357031206] [2025-01-09 13:20:02,466 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 13:20:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:20:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:20:02,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:20:02,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:20:02,467 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 13:20:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:03,046 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2025-01-09 13:20:03,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:20:03,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2025-01-09 13:20:03,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:03,049 INFO L225 Difference]: With dead ends: 226 [2025-01-09 13:20:03,049 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 13:20:03,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2025-01-09 13:20:03,051 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:20:03,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 312 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:20:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 13:20:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2025-01-09 13:20:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 86 states have internal predecessors, (97), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 13:20:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2025-01-09 13:20:03,065 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 81 [2025-01-09 13:20:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:03,065 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2025-01-09 13:20:03,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 13:20:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2025-01-09 13:20:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:20:03,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:03,067 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:03,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:20:03,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:03,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1843374713, now seen corresponding path program 1 times [2025-01-09 13:20:03,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:20:03,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954379743] [2025-01-09 13:20:03,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:03,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:20:03,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:03,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:20:03,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435599715] [2025-01-09 13:20:03,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:03,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:03,330 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20:03,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 13:20:03,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:03,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:03,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:03,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:20:03,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:20:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:03,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:03,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:03,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:20:03,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:20:03,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:20:03,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:20:03,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 13:20:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:20:03,631 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 13:20:03,663 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:20:03,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:20:03 BoogieIcfgContainer [2025-01-09 13:20:03,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:20:03,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:20:03,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:20:03,666 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:20:03,666 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:19:57" (3/4) ... [2025-01-09 13:20:03,670 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:20:03,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:20:03,671 INFO L158 Benchmark]: Toolchain (without parser) took 6414.12ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 92.9MB in the end (delta: 18.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-01-09 13:20:03,671 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.11ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 92.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: RCFGBuilder took 332.57ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 77.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: TraceAbstraction took 5807.47ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 92.9MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:03,675 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 92.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:20:03,676 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 99.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.11ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.7MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 92.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.57ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 77.0MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5807.47ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 92.9MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 92.9MB 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 someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] signed long int var_1_2 = 8; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 100; [L26] float var_1_5 = 99999999999.5; [L27] unsigned char var_1_6 = 4; [L28] float var_1_7 = 63.75; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char last_1_var_1_1 = 64; [L32] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L73] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L75] var_1_6 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_6 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] RET assume_abort_if_not(var_1_6 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L80] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L36] signed long int stepLocal_3 = last_1_var_1_1; [L37] signed long int stepLocal_2 = var_1_3 / var_1_6; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=64, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L38] COND TRUE var_1_3 < stepLocal_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L39] COND FALSE !(var_1_4 < stepLocal_2) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L49] signed long int stepLocal_1 = var_1_2; [L50] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=-256, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L51] COND TRUE stepLocal_1 <= -256 [L52] var_1_1 = ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L60] unsigned char stepLocal_4 = (var_1_1 + 64u) != var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_4=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L61] COND FALSE !((var_1_5 >= var_1_7) || stepLocal_4) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((var_1_2 <= -256) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))))) : ((var_1_4 <= var_1_2) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((var_1_3 < last_1_var_1_1) ? ((var_1_4 < (var_1_3 / var_1_6)) ? (var_1_5 == ((float) (var_1_7 - 16.55f))) : 1) : (last_1_var_1_9 ? (var_1_5 == ((float) var_1_7)) : (var_1_5 == ((float) var_1_7))))) && (((var_1_5 >= var_1_7) || ((var_1_1 + 64u) != var_1_4)) ? (var_1_9 == ((unsigned char) var_1_10)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 633 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 671 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 140 mSDtfsCounter, 671 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 320 ConstructedInterpolants, 7 QuantifiedInterpolants, 1311 SizeOfPredicates, 10 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 983/1056 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:20:03,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.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 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:20:05,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:20:06,001 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:20:06,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:20:06,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:20:06,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:20:06,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:20:06,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:20:06,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:20:06,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:20:06,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:20:06,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:20:06,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:20:06,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:20:06,045 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:20:06,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:20:06,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:20:06,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:20:06,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:20:06,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:20:06,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:20:06,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:20:06,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:06,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:20:06,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:06,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:20:06,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:20:06,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:20:06,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:20:06,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:20:06,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:20:06,050 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 -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2025-01-09 13:20:06,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:20:06,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:20:06,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:20:06,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:20:06,289 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:20:06,296 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-58.i [2025-01-09 13:20:07,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/573ffb19d/df3d641abeb34c73a05a00195ff664a9/FLAGb549ec4bd [2025-01-09 13:20:07,741 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:20:07,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2025-01-09 13:20:07,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/573ffb19d/df3d641abeb34c73a05a00195ff664a9/FLAGb549ec4bd [2025-01-09 13:20:08,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/573ffb19d/df3d641abeb34c73a05a00195ff664a9 [2025-01-09 13:20:08,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:20:08,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:20:08,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:08,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:20:08,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:20:08,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fea22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08, skipping insertion in model container [2025-01-09 13:20:08,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:20:08,230 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-58.i[915,928] [2025-01-09 13:20:08,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:08,279 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:20:08,287 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-58.i[915,928] [2025-01-09 13:20:08,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:20:08,308 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:20:08,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08 WrapperNode [2025-01-09 13:20:08,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:20:08,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:08,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:20:08,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:20:08,314 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:20:08" (1/1) ... [2025-01-09 13:20:08,323 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:20:08" (1/1) ... [2025-01-09 13:20:08,338 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-01-09 13:20:08,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:20:08,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:20:08,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:20:08,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:20:08,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,362 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:20:08,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:20:08,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:20:08,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:20:08,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:20:08,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (1/1) ... [2025-01-09 13:20:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:20:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:20:08,408 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:20:08,416 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:20:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:20:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:20:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:20:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:20:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:20:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:20:08,499 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:20:08,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:20:08,778 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 13:20:08,778 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:20:08,787 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:20:08,788 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:20:08,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:08 BoogieIcfgContainer [2025-01-09 13:20:08,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:20:08,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:20:08,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:20:08,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:20:08,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:20:08" (1/3) ... [2025-01-09 13:20:08,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cac3335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:08, skipping insertion in model container [2025-01-09 13:20:08,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:20:08" (2/3) ... [2025-01-09 13:20:08,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cac3335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:20:08, skipping insertion in model container [2025-01-09 13:20:08,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:20:08" (3/3) ... [2025-01-09 13:20:08,796 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2025-01-09 13:20:08,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:20:08,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:20:08,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:20:08,854 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;@1dcb1256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:20:08,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:20:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:20:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:20:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:08,869 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:08,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1395768115, now seen corresponding path program 1 times [2025-01-09 13:20:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:20:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499264796] [2025-01-09 13:20:08,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:08,880 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:20:08,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:20:08,882 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:20:08,884 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:20:08,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:09,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:09,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:20:09,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 13:20:09,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:20:09,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:20:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499264796] [2025-01-09 13:20:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499264796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:20:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:20:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:20:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462720148] [2025-01-09 13:20:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:09,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:20:09,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:20:09,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:20:09,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:20:09,105 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:20:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:09,119 INFO L93 Difference]: Finished difference Result 85 states and 135 transitions. [2025-01-09 13:20:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:20:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-01-09 13:20:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:09,124 INFO L225 Difference]: With dead ends: 85 [2025-01-09 13:20:09,124 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 13:20:09,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:20:09,128 INFO L435 NwaCegarLoop]: 61 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, 61 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:20:09,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:20:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 13:20:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 13:20:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:20:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-01-09 13:20:09,151 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 81 [2025-01-09 13:20:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-01-09 13:20:09,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:20:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-01-09 13:20:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:20:09,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:09,153 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,160 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:20:09,358 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:20:09,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1163316343, now seen corresponding path program 1 times [2025-01-09 13:20:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:20:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050250492] [2025-01-09 13:20:09,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:09,360 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:20:09,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:20:09,362 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:20:09,364 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:20:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:09,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:09,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:09,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:09,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 13:20:09,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 177 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-09 13:20:18,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:20:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 13:20:33,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:20:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050250492] [2025-01-09 13:20:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050250492] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:33,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:20:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2025-01-09 13:20:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221035902] [2025-01-09 13:20:33,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:20:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:20:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:20:33,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:20:33,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:20:33,109 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:20:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:20:40,598 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2025-01-09 13:20:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:20:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-01-09 13:20:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:20:40,603 INFO L225 Difference]: With dead ends: 61 [2025-01-09 13:20:40,603 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 13:20:40,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2025-01-09 13:20:40,604 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 51 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:20:40,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 284 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:20:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 13:20:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2025-01-09 13:20:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:20:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-09 13:20:40,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 81 [2025-01-09 13:20:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:20:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-09 13:20:40,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 13:20:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-01-09 13:20:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 13:20:40,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:20:40,627 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,633 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:20:40,828 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:20:40,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:20:40,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:20:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1161469301, now seen corresponding path program 1 times [2025-01-09 13:20:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:20:40,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458406047] [2025-01-09 13:20:40,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:40,834 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:20:40,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:20:40,840 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:20:40,842 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:20:40,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:40,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:40,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:40,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:40,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 13:20:40,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:20:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 13:20:41,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:20:57,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:20:57,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458406047] [2025-01-09 13:20:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458406047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:20:57,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1903513512] [2025-01-09 13:20:57,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:20:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:20:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:20:57,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:20:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 13:20:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 13:20:58,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 13:20:58,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:20:58,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:20:58,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 13:20:58,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:21:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 13:21:23,233 INFO L312 TraceCheckSpWp]: Computing backward predicates...