./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.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_operatoramount_amount10_file-44.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', 'b7c0c1846e9a6fbcad5ffdf5765d9507f8f71f41aa86cc236ddeb4027e19a311'] 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_operatoramount_amount10_file-44.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 b7c0c1846e9a6fbcad5ffdf5765d9507f8f71f41aa86cc236ddeb4027e19a311 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:14:15,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:14:15,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:14:15,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:14:15,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:14:15,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:14:15,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:14:15,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:14:15,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:14:15,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:14:15,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:14:15,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:14:15,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:14:15,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:14:15,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:14:15,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:14:15,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:14:15,224 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:14:15,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:14:15,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:14:15,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:14:15,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:14:15,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:14:15,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:14:15,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:14:15,225 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 -> b7c0c1846e9a6fbcad5ffdf5765d9507f8f71f41aa86cc236ddeb4027e19a311 [2024-11-07 09:14:15,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:14:15,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:14:15,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:14:15,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:14:15,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:14:15,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i [2024-11-07 09:14:16,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:14:17,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:14:17,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-44.i [2024-11-07 09:14:17,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e2fa6989/d30ede79efac4153b320008cde0b9004/FLAGe7cf36ca7 [2024-11-07 09:14:17,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e2fa6989/d30ede79efac4153b320008cde0b9004 [2024-11-07 09:14:17,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:14:17,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:14:17,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:14:17,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:14:17,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:14:17,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325e29ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17, skipping insertion in model container [2024-11-07 09:14:17,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:14:17,536 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_operatoramount_amount10_file-44.i[915,928] [2024-11-07 09:14:17,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:14:17,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:14:17,587 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_operatoramount_amount10_file-44.i[915,928] [2024-11-07 09:14:17,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:14:17,621 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:14:17,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17 WrapperNode [2024-11-07 09:14:17,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:14:17,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:14:17,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:14:17,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:14:17,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,656 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-07 09:14:17,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:14:17,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:14:17,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:14:17,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:14:17,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,688 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 09:14:17,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:14:17,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:14:17,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:14:17,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:14:17,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (1/1) ... [2024-11-07 09:14:17,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:14:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:14:17,736 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 09:14:17,740 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 09:14:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:14:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:14:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:14:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:14:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:14:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:14:17,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:14:17,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:14:17,963 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:14:17,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:14:17,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:14:17,973 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:14:17,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:14:17 BoogieIcfgContainer [2024-11-07 09:14:17,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:14:17,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:14:17,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:14:17,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:14:17,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:14:17" (1/3) ... [2024-11-07 09:14:17,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552ef319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:14:17, skipping insertion in model container [2024-11-07 09:14:17,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:14:17" (2/3) ... [2024-11-07 09:14:17,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552ef319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:14:17, skipping insertion in model container [2024-11-07 09:14:17,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:14:17" (3/3) ... [2024-11-07 09:14:17,983 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-44.i [2024-11-07 09:14:17,997 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:14:17,997 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:14:18,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:14:18,075 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;@55a1ed34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:14:18,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:14:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:14:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 09:14:18,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:14:18,091 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:18,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:14:18,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:14:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1117978249, now seen corresponding path program 1 times [2024-11-07 09:14:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:14:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668350453] [2024-11-07 09:14:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:14:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:14:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:14:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:14:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:14:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:14:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:14:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:14:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:14:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:14:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:14:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:14:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:14:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:14:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:14:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:14:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:14:18,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:14:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668350453] [2024-11-07 09:14:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668350453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:14:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:14:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:14:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280496101] [2024-11-07 09:14:18,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:14:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:14:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:14:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:14:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:14:18,473 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 09:14:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:14:18,498 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2024-11-07 09:14:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:14:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-11-07 09:14:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:14:18,505 INFO L225 Difference]: With dead ends: 77 [2024-11-07 09:14:18,505 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 09:14:18,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 09:14:18,512 INFO L432 NwaCegarLoop]: 53 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, 53 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 09:14:18,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:14:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 09:14:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 09:14:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:14:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-07 09:14:18,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 87 [2024-11-07 09:14:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:14:18,547 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-07 09:14:18,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 09:14:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-07 09:14:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 09:14:18,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:14:18,551 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:18,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:14:18,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:14:18,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:14:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1001633097, now seen corresponding path program 1 times [2024-11-07 09:14:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:14:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607473463] [2024-11-07 09:14:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:14:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:14:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:14:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:14:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:14:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:14:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:14:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:14:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:14:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:14:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:14:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:14:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:14:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:14:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:14:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:14:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:14:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:14:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607473463] [2024-11-07 09:14:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607473463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:14:19,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:14:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:14:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662346836] [2024-11-07 09:14:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:14:19,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:14:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:14:19,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:14:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:14:19,566 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:14:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:14:19,790 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-07 09:14:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:14:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-11-07 09:14:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:14:19,793 INFO L225 Difference]: With dead ends: 46 [2024-11-07 09:14:19,794 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 09:14:19,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:14:19,795 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:14:19,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:14:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 09:14:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-07 09:14:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 09:14:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-07 09:14:19,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 87 [2024-11-07 09:14:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:14:19,811 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-07 09:14:19,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:14:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-07 09:14:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 09:14:19,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:14:19,813 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:14:19,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:14:19,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:14:19,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:14:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -932353188, now seen corresponding path program 1 times [2024-11-07 09:14:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:14:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009786106] [2024-11-07 09:14:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:14:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:14:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:14:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:14:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:14:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:14:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:14:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:14:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:14:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:14:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:14:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 09:14:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 09:14:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 09:14:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 09:14:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 09:14:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:14:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 09:14:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:14:20,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009786106] [2024-11-07 09:14:20,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009786106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:14:20,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:14:20,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:14:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830177556] [2024-11-07 09:14:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:14:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:14:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:14:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:14:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:14:20,555 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:14:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:14:20,905 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-07 09:14:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:14:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-11-07 09:14:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:14:20,906 INFO L225 Difference]: With dead ends: 46 [2024-11-07 09:14:20,906 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:14:20,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 09:14:20,907 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:14:20,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 213 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:14:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:14:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:14:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 09:14:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:14:20,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2024-11-07 09:14:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:14:20,908 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:14:20,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 09:14:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:14:20,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:14:20,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:14:20,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:14:20,916 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 09:14:20,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:14:20,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:14:21,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:14:21 BoogieIcfgContainer [2024-11-07 09:14:21,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:14:21,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:14:21,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:14:21,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:14:21,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:14:17" (3/4) ... [2024-11-07 09:14:21,025 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:14:21,029 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:14:21,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 09:14:21,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:14:21,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:14:21,034 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:14:21,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:14:21,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:14:21,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:14:21,105 INFO L158 Benchmark]: Toolchain (without parser) took 3724.04ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.7MB in the beginning and 88.8MB in the end (delta: 2.9MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2024-11-07 09:14:21,105 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:14:21,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.96ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:21,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:14:21,106 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:14:21,106 INFO L158 Benchmark]: RCFGBuilder took 271.26ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 65.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:21,106 INFO L158 Benchmark]: TraceAbstraction took 3044.78ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 64.9MB in the beginning and 93.8MB in the end (delta: -28.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-07 09:14:21,106 INFO L158 Benchmark]: Witness Printer took 83.30ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 88.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:21,108 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.18ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.96ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 79.9MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.26ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 65.4MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3044.78ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 64.9MB in the beginning and 93.8MB in the end (delta: -28.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 83.30ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 88.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 156 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((var_1_6 < (((short) var_1_4 + var_1_5) + 1)) || (((127 < ((((short) var_1_4 + var_1_5) >= 0) ? (((short) var_1_4 + var_1_5) % 256) : ((((short) var_1_4 + var_1_5) % 256) + 256))) || (((((short) var_1_4 + var_1_5) >= 0) ? (((short) var_1_4 + var_1_5) % 256) : ((((short) var_1_4 + var_1_5) % 256) + 256)) != (256 + var_1_1))) && (((((((short) var_1_4 + var_1_5) >= 0) ? (((short) var_1_4 + var_1_5) % 256) : ((((short) var_1_4 + var_1_5) % 256) + 256)) <= 127) && (((((short) var_1_4 + var_1_5) >= 0) ? (((short) var_1_4 + var_1_5) % 256) : ((((short) var_1_4 + var_1_5) % 256) + 256)) == var_1_1)) || (((((short) var_1_4 + var_1_5) >= 0) ? (((short) var_1_4 + var_1_5) % 256) : ((((short) var_1_4 + var_1_5) % 256) + 256)) == (256 + var_1_1))))) && ((((127 < ((var_1_6 >= 0) ? (var_1_6 % 256) : ((var_1_6 % 256) + 256))) || ((256 + var_1_1) != ((var_1_6 >= 0) ? (var_1_6 % 256) : ((var_1_6 % 256) + 256)))) && (((var_1_1 == ((var_1_6 >= 0) ? (var_1_6 % 256) : ((var_1_6 % 256) + 256))) && (((var_1_6 >= 0) ? (var_1_6 % 256) : ((var_1_6 % 256) + 256)) <= 127)) || ((256 + var_1_1) == ((var_1_6 >= 0) ? (var_1_6 % 256) : ((var_1_6 % 256) + 256))))) || (((short) var_1_4 + var_1_5) < var_1_6))) || (var_1_2 < var_1_3)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:14:21,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE