./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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-while_file-92.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406'] 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-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:37:09,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:37:09,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:37:09,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:37:09,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:37:09,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:37:09,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:37:09,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:37:09,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:37:09,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:37:09,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:37:09,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:37:09,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:37:09,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:37:09,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:37:09,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:37:09,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:37:09,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:37:09,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:37:09,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:37:09,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:09,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:37:09,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:37:09,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:37:09,337 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2024-11-07 08:37:09,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:37:09,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:37:09,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:37:09,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:37:09,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:37:09,634 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-while_file-92.i [2024-11-07 08:37:10,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:37:11,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:37:11,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-11-07 08:37:11,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15efd5a7b/87fb03f96b48433d9a069303434ea04f/FLAG052ad82ac [2024-11-07 08:37:11,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15efd5a7b/87fb03f96b48433d9a069303434ea04f [2024-11-07 08:37:11,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:37:11,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:37:11,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:11,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:37:11,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:37:11,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1486f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11, skipping insertion in model container [2024-11-07 08:37:11,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:37:11,434 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-while_file-92.i[915,928] [2024-11-07 08:37:11,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:11,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:37:11,513 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-while_file-92.i[915,928] [2024-11-07 08:37:11,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:11,552 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:37:11,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11 WrapperNode [2024-11-07 08:37:11,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:11,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:11,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:37:11,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:37:11,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,612 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-11-07 08:37:11,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:11,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:37:11,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:37:11,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:37:11,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,647 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]. [2024-11-07 08:37:11,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:37:11,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:37:11,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:37:11,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:37:11,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (1/1) ... [2024-11-07 08:37:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:37:11,715 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) [2024-11-07 08:37:11,723 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 [2024-11-07 08:37:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:37:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:37:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:37:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:37:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:37:11,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:37:11,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:37:11,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:37:12,054 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 08:37:12,054 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:37:12,062 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:37:12,065 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:37:12,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:12 BoogieIcfgContainer [2024-11-07 08:37:12,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:37:12,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:37:12,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:37:12,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:37:12,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:37:11" (1/3) ... [2024-11-07 08:37:12,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4656406d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:12, skipping insertion in model container [2024-11-07 08:37:12,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:11" (2/3) ... [2024-11-07 08:37:12,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4656406d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:12, skipping insertion in model container [2024-11-07 08:37:12,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:12" (3/3) ... [2024-11-07 08:37:12,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2024-11-07 08:37:12,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:37:12,091 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:37:12,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:37:12,163 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;@2f0175d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:37:12,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:37:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 08:37:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 08:37:12,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:12,181 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:12,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:12,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash 500852861, now seen corresponding path program 1 times [2024-11-07 08:37:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255872796] [2024-11-07 08:37:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:37:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:37:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:37:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 08:37:12,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:12,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255872796] [2024-11-07 08:37:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255872796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:37:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625321481] [2024-11-07 08:37:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:12,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:37:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:37:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:12,556 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:37:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:12,580 INFO L93 Difference]: Finished difference Result 115 states and 191 transitions. [2024-11-07 08:37:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:37:12,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2024-11-07 08:37:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:12,587 INFO L225 Difference]: With dead ends: 115 [2024-11-07 08:37:12,588 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 08:37:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:12,592 INFO L432 NwaCegarLoop]: 83 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, 83 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 [2024-11-07 08:37:12,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 08:37:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-07 08:37:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 08:37:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-11-07 08:37:12,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 111 [2024-11-07 08:37:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:12,641 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-11-07 08:37:12,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:37:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-11-07 08:37:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 08:37:12,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:12,645 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:12,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:37:12,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:12,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2111517569, now seen corresponding path program 1 times [2024-11-07 08:37:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748421241] [2024-11-07 08:37:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:37:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:37:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:37:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 08:37:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748421241] [2024-11-07 08:37:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748421241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:37:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568473131] [2024-11-07 08:37:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:12,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:37:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:37:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:37:12,921 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:12,971 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2024-11-07 08:37:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:37:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-07 08:37:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:12,977 INFO L225 Difference]: With dead ends: 153 [2024-11-07 08:37:12,977 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 08:37:12,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:37:12,981 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:12,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 08:37:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-07 08:37:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:37:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-07 08:37:13,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 111 [2024-11-07 08:37:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-07 08:37:13,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-07 08:37:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 08:37:13,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:13,008 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:37:13,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1431459199, now seen corresponding path program 1 times [2024-11-07 08:37:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427527634] [2024-11-07 08:37:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:37:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:37:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:37:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:37:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:37:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:37:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:37:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:37:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:37:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:37:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:37:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:37:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:37:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:37:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:37:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:37:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:37:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 08:37:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:37:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427527634] [2024-11-07 08:37:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427527634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:37:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165440042] [2024-11-07 08:37:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:37:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:37:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:37:13,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:37:13,450 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:13,666 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2024-11-07 08:37:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:37:13,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-07 08:37:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:13,670 INFO L225 Difference]: With dead ends: 191 [2024-11-07 08:37:13,670 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 08:37:13,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:37:13,674 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:13,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:37:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 08:37:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-11-07 08:37:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:37:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-07 08:37:13,697 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 111 [2024-11-07 08:37:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:13,699 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-07 08:37:13,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-07 08:37:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 08:37:13,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:13,701 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:37:13,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:13,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2076908260, now seen corresponding path program 1 times [2024-11-07 08:37:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:37:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536602619] [2024-11-07 08:37:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:37:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:37:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60372620] [2024-11-07 08:37:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:37:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:37:13,820 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) [2024-11-07 08:37:13,821 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 [2024-11-07 08:37:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:37:13,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:37:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:37:14,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:37:14,052 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:37:14,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:37:14,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:37:14,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:37:14,261 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 08:37:14,350 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:37:14,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:37:14 BoogieIcfgContainer [2024-11-07 08:37:14,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:37:14,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:37:14,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:37:14,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:37:14,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:12" (3/4) ... [2024-11-07 08:37:14,363 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:37:14,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:37:14,367 INFO L158 Benchmark]: Toolchain (without parser) took 3088.44ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.1MB in the beginning and 122.3MB in the end (delta: -30.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-07 08:37:14,370 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:14,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.82ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:14,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.42ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:37:14,370 INFO L158 Benchmark]: Boogie Preprocessor took 54.99ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:14,370 INFO L158 Benchmark]: RCFGBuilder took 396.72ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 59.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:37:14,371 INFO L158 Benchmark]: TraceAbstraction took 2291.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 122.4MB in the end (delta: -63.7MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-11-07 08:37:14,371 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:37:14,373 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.24ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.82ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.42ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 77.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.99ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 75.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 396.72ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 59.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2291.34ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 122.4MB in the end (delta: -63.7MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 57.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] signed char var_1_9 = 25; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] float var_1_12 = 0.25; [L34] unsigned short int var_1_13 = 54726; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L67] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L68] var_1_3 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L70] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L71] var_1_4 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L73] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L74] var_1_5 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L76] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L77] var_1_6 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L79] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_8=333/20, var_1_9=25] [L80] var_1_8 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L81] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=54726, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L89] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] CALL assume_abort_if_not(var_1_13 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L90] RET assume_abort_if_not(var_1_13 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L103] RET updateVariables() [L104] CALL step() [L38] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) [L39] signed char stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] EXPR var_1_6 & var_1_3 VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=8000005/8, var_1_9=25] [L40] COND TRUE ((~ var_1_5) * (var_1_6 & var_1_3)) >= stepLocal_0 [L41] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L43] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L44] COND FALSE !(stepLocal_1 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L47] signed long int stepLocal_4 = var_1_13 - var_1_5; [L48] unsigned char stepLocal_3 = var_1_10; [L49] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=1/4, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L50] COND FALSE !(var_1_11 || stepLocal_3) [L61] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_2=0, stepLocal_4=32767, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L95-L96] return (((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : 1)) && ((var_1_10 && var_1_11) ? (var_1_9 == ((signed char) (var_1_3 - var_1_2))) : 1)) && ((var_1_11 || var_1_10) ? ((var_1_10 || (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) < 32)) ? (((var_1_13 - var_1_5) < var_1_2) ? (var_1_12 == ((float) var_1_8)) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) : (var_1_12 == ((float) var_1_8))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=32767, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=2, var_1_8=2, var_1_9=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 449 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 279 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 1145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:37:14,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.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 d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:37:16,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:37:16,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:37:16,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:37:16,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:37:16,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:37:16,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:37:16,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:37:16,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:37:16,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:37:16,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:37:16,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:37:16,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:37:16,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:37:16,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:37:16,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:37:16,794 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:37:16,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:37:16,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:16,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:37:16,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:37:16,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:37:16,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:37:16,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:37:16,797 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 -> d52da112b6c70caf5a0051f5b07592777e147cdc0a968527b7dd1b58dd51c406 [2024-11-07 08:37:17,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:37:17,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:37:17,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:37:17,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:37:17,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:37:17,126 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-while_file-92.i [2024-11-07 08:37:18,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:37:18,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:37:18,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-92.i [2024-11-07 08:37:18,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb48ef792/170988fb370744398811cb2f5d611027/FLAGd6c868692 [2024-11-07 08:37:19,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb48ef792/170988fb370744398811cb2f5d611027 [2024-11-07 08:37:19,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:37:19,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:37:19,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:19,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:37:19,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:37:19,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fc126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19, skipping insertion in model container [2024-11-07 08:37:19,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:37:19,179 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-while_file-92.i[915,928] [2024-11-07 08:37:19,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:19,237 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:37:19,247 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-while_file-92.i[915,928] [2024-11-07 08:37:19,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:37:19,278 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:37:19,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19 WrapperNode [2024-11-07 08:37:19,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:37:19,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:19,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:37:19,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:37:19,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,336 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-07 08:37:19,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:37:19,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:37:19,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:37:19,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:37:19,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,373 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]. [2024-11-07 08:37:19,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:37:19,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:37:19,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:37:19,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:37:19,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (1/1) ... [2024-11-07 08:37:19,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:37:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:37:19,448 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) [2024-11-07 08:37:19,455 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 [2024-11-07 08:37:19,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:37:19,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:37:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:37:19,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:37:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:37:19,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:37:19,564 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:37:19,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:37:20,544 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 08:37:20,544 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:37:20,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:37:20,556 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:37:20,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:20 BoogieIcfgContainer [2024-11-07 08:37:20,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:37:20,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:37:20,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:37:20,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:37:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:37:19" (1/3) ... [2024-11-07 08:37:20,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c0355e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:20, skipping insertion in model container [2024-11-07 08:37:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:19" (2/3) ... [2024-11-07 08:37:20,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c0355e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:20, skipping insertion in model container [2024-11-07 08:37:20,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:20" (3/3) ... [2024-11-07 08:37:20,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-92.i [2024-11-07 08:37:20,582 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:37:20,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:37:20,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:37:20,641 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;@6bc1698c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:37:20,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:37:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 08:37:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 08:37:20,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:20,656 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:20,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1811266942, now seen corresponding path program 1 times [2024-11-07 08:37:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435350321] [2024-11-07 08:37:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:20,686 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 [2024-11-07 08:37:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:20,691 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) [2024-11-07 08:37:20,692 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 [2024-11-07 08:37:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:20,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:37:20,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-07 08:37:20,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:37:20,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:37:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435350321] [2024-11-07 08:37:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435350321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:20,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:37:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163953206] [2024-11-07 08:37:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:20,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:37:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:20,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:37:20,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:20,953 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:37:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:20,972 INFO L93 Difference]: Finished difference Result 97 states and 163 transitions. [2024-11-07 08:37:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:37:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-11-07 08:37:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:20,977 INFO L225 Difference]: With dead ends: 97 [2024-11-07 08:37:20,978 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 08:37:20,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:37:20,982 INFO L432 NwaCegarLoop]: 69 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, 69 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 [2024-11-07 08:37:20,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:37:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 08:37:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 08:37:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 08:37:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-07 08:37:21,015 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 108 [2024-11-07 08:37:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-07 08:37:21,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 08:37:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-07 08:37:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 08:37:21,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:21,021 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:21,027 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 [2024-11-07 08:37:21,222 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 [2024-11-07 08:37:21,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:21,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1752934588, now seen corresponding path program 1 times [2024-11-07 08:37:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069063246] [2024-11-07 08:37:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:21,224 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 [2024-11-07 08:37:21,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:21,226 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) [2024-11-07 08:37:21,227 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 [2024-11-07 08:37:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:21,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:37:21,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 08:37:21,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:37:21,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:37:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069063246] [2024-11-07 08:37:21,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069063246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:37:21,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:37:21,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:37:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994369994] [2024-11-07 08:37:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:37:21,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:37:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:37:21,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:37:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:37:21,458 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:37:21,738 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2024-11-07 08:37:21,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:37:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-07 08:37:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:37:21,742 INFO L225 Difference]: With dead ends: 129 [2024-11-07 08:37:21,742 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 08:37:21,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:37:21,743 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:37:21,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:37:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 08:37:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-07 08:37:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 08:37:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-07 08:37:21,763 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 108 [2024-11-07 08:37:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:37:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-07 08:37:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 08:37:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-07 08:37:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 08:37:21,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:37:21,766 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:37:21,775 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 [2024-11-07 08:37:21,972 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 [2024-11-07 08:37:21,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:37:21,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:37:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash -767025346, now seen corresponding path program 1 times [2024-11-07 08:37:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:37:21,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037674216] [2024-11-07 08:37:21,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:37:21,975 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 [2024-11-07 08:37:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:37:21,977 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) [2024-11-07 08:37:21,978 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 [2024-11-07 08:37:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:37:22,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 08:37:22,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:37:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 256 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-07 08:37:38,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:38:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 08:38:23,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:38:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037674216] [2024-11-07 08:38:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037674216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:38:23,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:38:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 31 [2024-11-07 08:38:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15705245] [2024-11-07 08:38:23,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:38:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 08:38:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:38:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 08:38:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2024-11-07 08:38:23,672 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 31 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 29 states have internal predecessors, (72), 8 states have call successors, (34), 7 states have call predecessors, (34), 9 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34)