./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.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-22.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', '980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c'] 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-22.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 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:13:19,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:13:19,665 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:13:19,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:13:19,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:13:19,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:13:19,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:13:19,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:13:19,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:13:19,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:13:19,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:13:19,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:13:19,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:13:19,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:13:19,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:13:19,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:13:19,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:13:19,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:13:19,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:19,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:13:19,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:13:19,706 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2024-11-07 09:13:19,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:13:20,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:13:20,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:13:20,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:13:20,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:13:20,010 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-22.i [2024-11-07 09:13:21,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:13:21,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:13:21,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-07 09:13:21,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0910734b2/2ec2be164fbc41b086a3f0f25f935b44/FLAG28b8a50da [2024-11-07 09:13:21,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0910734b2/2ec2be164fbc41b086a3f0f25f935b44 [2024-11-07 09:13:21,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:13:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:13:21,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:21,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:13:21,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:13:21,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1e25a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21, skipping insertion in model container [2024-11-07 09:13:21,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:13:21,643 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-22.i[915,928] [2024-11-07 09:13:21,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:21,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:13:21,684 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-22.i[915,928] [2024-11-07 09:13:21,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:21,711 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:13:21,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21 WrapperNode [2024-11-07 09:13:21,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:21,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:21,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:13:21,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:13:21,717 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:13:21" (1/1) ... [2024-11-07 09:13:21,722 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:13:21" (1/1) ... [2024-11-07 09:13:21,734 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-11-07 09:13:21,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:21,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:13:21,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:13:21,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:13:21,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,756 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:13:21,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:13:21,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:13:21,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:13:21,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:13:21,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (1/1) ... [2024-11-07 09:13:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:13:21,789 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:13:21,792 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:13:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:13:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:13:21,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:13:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:13:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:13:21,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:13:21,865 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:13:21,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:13:21,960 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:13:21,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:13:21,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:13:21,966 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:13:21,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:21 BoogieIcfgContainer [2024-11-07 09:13:21,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:13:21,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:13:21,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:13:21,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:13:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:13:21" (1/3) ... [2024-11-07 09:13:21,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8eb4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:21, skipping insertion in model container [2024-11-07 09:13:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:21" (2/3) ... [2024-11-07 09:13:21,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8eb4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:21, skipping insertion in model container [2024-11-07 09:13:21,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:21" (3/3) ... [2024-11-07 09:13:21,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-11-07 09:13:21,984 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:13:21,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:13:22,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:13:22,024 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;@3c5f3461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:13:22,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:13:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 09:13:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 09:13:22,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:22,033 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 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:13:22,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:22,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -706627639, now seen corresponding path program 1 times [2024-11-07 09:13:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:13:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235849027] [2024-11-07 09:13:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:13:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:13:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:13:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:13:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:13:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:13:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 09:13:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:13:22,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235849027] [2024-11-07 09:13:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235849027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:13:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692831781] [2024-11-07 09:13:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:13:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:13:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:13:22,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:13:22,179 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 09:13:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:22,189 INFO L93 Difference]: Finished difference Result 55 states and 81 transitions. [2024-11-07 09:13:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:13:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-07 09:13:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:22,194 INFO L225 Difference]: With dead ends: 55 [2024-11-07 09:13:22,194 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 09:13:22,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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:13:22,198 INFO L432 NwaCegarLoop]: 34 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, 34 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:13:22,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:13:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 09:13:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 09:13:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 09:13:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-07 09:13:22,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2024-11-07 09:13:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-07 09:13:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 09:13:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-07 09:13:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 09:13:22,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:22,221 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 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:13:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:13:22,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash -51026809, now seen corresponding path program 1 times [2024-11-07 09:13:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:13:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460545933] [2024-11-07 09:13:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:13:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:13:22,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:13:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:13:22,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:13:22,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:13:22,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:13:22,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:13:22,337 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-07 09:13:22,353 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:13:22,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:13:22 BoogieIcfgContainer [2024-11-07 09:13:22,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:13:22,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:13:22,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:13:22,356 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:13:22,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:21" (3/4) ... [2024-11-07 09:13:22,358 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:13:22,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:13:22,359 INFO L158 Benchmark]: Toolchain (without parser) took 848.89ms. Allocated memory is still 109.1MB. Free memory was 85.7MB in the beginning and 77.5MB in the end (delta: 8.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-07 09:13:22,359 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:22,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.40ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 74.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:22,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.22ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:22,360 INFO L158 Benchmark]: Boogie Preprocessor took 27.38ms. Allocated memory is still 109.1MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:22,360 INFO L158 Benchmark]: RCFGBuilder took 202.70ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 60.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:13:22,361 INFO L158 Benchmark]: TraceAbstraction took 386.50ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 77.5MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:22,361 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 77.5MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:13:22,362 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.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.40ms. Allocated memory is still 109.1MB. Free memory was 85.5MB in the beginning and 74.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.22ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.38ms. Allocated memory is still 109.1MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 202.70ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 60.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 386.50ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 77.5MB in the end (delta: -17.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 109.1MB. Free memory was 77.5MB in the beginning and 77.5MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] double var_1_2 = 999999.2; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 100.52; [L26] double var_1_5 = 31.2; [L27] float var_1_6 = 5.8; VAL [isInitial=0, var_1_1=0, var_1_2=4999996/5, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L58] isInitial = 1 [L59] FCALL initially() [L60] COND TRUE 1 [L61] FCALL updateLastVariables() [L62] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L42] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L43] var_1_3 = __VERIFIER_nondet_uchar() [L44] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L44] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L46] var_1_5 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L47] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L48] var_1_6 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L49] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L62] RET updateVariables() [L63] CALL step() [L31] COND FALSE !(var_1_2 <= var_1_5) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L36] COND TRUE 1.125 >= var_1_4 [L37] var_1_1 = (! (! var_1_3)) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L63] RET step() [L64] CALL, EXPR property() [L54-L55] return ((1.125 >= var_1_4) ? (var_1_1 == ((unsigned char) (! (! var_1_3)))) : 1) && ((var_1_2 <= var_1_5) ? ((! var_1_3) ? (var_1_4 == ((float) var_1_6)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L64] RET, EXPR property() [L64] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 40/40 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 09:13:22,384 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_operatoramount_amount10_file-22.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 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:13:24,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:13:24,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:13:24,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:13:24,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:13:24,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:13:24,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:13:24,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:13:24,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:13:24,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:13:24,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:13:24,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:13:24,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:13:24,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:13:24,710 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:13:24,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:13:24,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:13:24,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:13:24,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:13:24,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:13:24,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:13:24,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:24,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:13:24,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:13:24,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:13:24,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:13:24,713 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2024-11-07 09:13:24,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:13:24,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:13:24,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:13:24,975 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:13:24,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:13:24,976 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-22.i [2024-11-07 09:13:26,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:13:26,439 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:13:26,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-07 09:13:26,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff03d5a31/6f56ba93c5024672a05333315d65ffc9/FLAG7d35e77e6 [2024-11-07 09:13:26,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff03d5a31/6f56ba93c5024672a05333315d65ffc9 [2024-11-07 09:13:26,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:13:26,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:13:26,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:26,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:13:26,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:13:26,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196b0661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26, skipping insertion in model container [2024-11-07 09:13:26,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:13:26,601 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-22.i[915,928] [2024-11-07 09:13:26,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:26,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:13:26,651 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-22.i[915,928] [2024-11-07 09:13:26,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:13:26,679 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:13:26,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26 WrapperNode [2024-11-07 09:13:26,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:13:26,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:26,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:13:26,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:13:26,687 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:13:26" (1/1) ... [2024-11-07 09:13:26,695 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:13:26" (1/1) ... [2024-11-07 09:13:26,710 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-11-07 09:13:26,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:13:26,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:13:26,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:13:26,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:13:26,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,731 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:13:26,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:13:26,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:13:26,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:13:26,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:13:26,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (1/1) ... [2024-11-07 09:13:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:13:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:13:26,794 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:13:26,800 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:13:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:13:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:13:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:13:26,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:13:26,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:13:26,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:13:26,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:13:26,880 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:13:27,182 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 09:13:27,182 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:13:27,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:13:27,189 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:13:27,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:27 BoogieIcfgContainer [2024-11-07 09:13:27,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:13:27,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:13:27,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:13:27,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:13:27,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:13:26" (1/3) ... [2024-11-07 09:13:27,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794625a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:27, skipping insertion in model container [2024-11-07 09:13:27,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:13:26" (2/3) ... [2024-11-07 09:13:27,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2794625a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:13:27, skipping insertion in model container [2024-11-07 09:13:27,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:27" (3/3) ... [2024-11-07 09:13:27,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-11-07 09:13:27,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:13:27,208 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:13:27,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:13:27,267 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;@5b4570d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:13:27,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:13:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 09:13:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 09:13:27,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:27,277 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 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:13:27,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash -706627639, now seen corresponding path program 1 times [2024-11-07 09:13:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:27,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327148412] [2024-11-07 09:13:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:27,290 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 09:13:27,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:27,293 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 09:13:27,296 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 09:13:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:27,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:13:27,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 09:13:27,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:27,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327148412] [2024-11-07 09:13:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327148412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:13:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527666273] [2024-11-07 09:13:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:27,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:13:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:13:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:13:27,519 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 09:13:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:27,535 INFO L93 Difference]: Finished difference Result 55 states and 81 transitions. [2024-11-07 09:13:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:13:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-07 09:13:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:27,547 INFO L225 Difference]: With dead ends: 55 [2024-11-07 09:13:27,548 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 09:13:27,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 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:13:27,554 INFO L432 NwaCegarLoop]: 34 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, 34 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:13:27,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:13:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 09:13:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 09:13:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 09:13:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-07 09:13:27,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2024-11-07 09:13:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:27,603 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-07 09:13:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 09:13:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-07 09:13:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 09:13:27,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:27,605 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 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:13:27,611 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 09:13:27,805 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 09:13:27,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:27,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash -51026809, now seen corresponding path program 1 times [2024-11-07 09:13:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795019735] [2024-11-07 09:13:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:27,807 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 09:13:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:27,813 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 09:13:27,815 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 09:13:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:27,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 09:13:27,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 09:13:28,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:28,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795019735] [2024-11-07 09:13:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795019735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:28,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:28,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:13:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32620750] [2024-11-07 09:13:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:13:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:13:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:13:28,149 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:28,416 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2024-11-07 09:13:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:13:28,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-11-07 09:13:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:28,420 INFO L225 Difference]: With dead ends: 75 [2024-11-07 09:13:28,420 INFO L226 Difference]: Without dead ends: 51 [2024-11-07 09:13:28,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 09:13:28,421 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:28,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 09:13:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-07 09:13:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-07 09:13:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:13:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-07 09:13:28,446 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 40 [2024-11-07 09:13:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:28,450 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-07 09:13:28,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-07 09:13:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 09:13:28,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:28,451 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 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:13:28,461 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 09:13:28,652 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 09:13:28,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -49179767, now seen corresponding path program 1 times [2024-11-07 09:13:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448813659] [2024-11-07 09:13:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:28,653 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 09:13:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:28,657 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 09:13:28,658 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 09:13:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:28,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 09:13:28,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 09:13:29,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:29,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448813659] [2024-11-07 09:13:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448813659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:13:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79890579] [2024-11-07 09:13:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:29,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:13:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:29,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:13:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:13:29,441 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:29,954 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-07 09:13:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:13:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-11-07 09:13:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:29,955 INFO L225 Difference]: With dead ends: 60 [2024-11-07 09:13:29,956 INFO L226 Difference]: Without dead ends: 58 [2024-11-07 09:13:29,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:13:29,956 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:29,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:13:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-07 09:13:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-11-07 09:13:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:13:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-07 09:13:29,962 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 40 [2024-11-07 09:13:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:29,962 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-07 09:13:29,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-07 09:13:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 09:13:29,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:29,963 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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:13:29,971 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 (4)] Ended with exit code 0 [2024-11-07 09:13:30,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 09:13:30,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:30,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash -294239510, now seen corresponding path program 1 times [2024-11-07 09:13:30,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:30,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267865171] [2024-11-07 09:13:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:30,165 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 09:13:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:30,168 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:13:30,169 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 (5)] Waiting until timeout for monitored process [2024-11-07 09:13:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:30,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 09:13:30,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 09:13:30,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:13:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 09:13:30,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:30,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267865171] [2024-11-07 09:13:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267865171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:13:30,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:13:30,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 09:13:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307603395] [2024-11-07 09:13:30,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:13:30,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:13:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:13:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:13:30,428 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 09:13:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:30,628 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2024-11-07 09:13:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:13:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2024-11-07 09:13:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:30,635 INFO L225 Difference]: With dead ends: 111 [2024-11-07 09:13:30,635 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 09:13:30,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:13:30,636 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:30,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 09:13:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 09:13:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-11-07 09:13:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 09:13:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-07 09:13:30,647 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 41 [2024-11-07 09:13:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:30,648 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-07 09:13:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 09:13:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-07 09:13:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 09:13:30,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:30,653 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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:13:30,663 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 (5)] Ended with exit code 0 [2024-11-07 09:13:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 09:13:30,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -353344854, now seen corresponding path program 1 times [2024-11-07 09:13:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490890857] [2024-11-07 09:13:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:30,859 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 09:13:30,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:30,862 INFO L229 MonitoredProcess]: Starting monitored process 6 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 09:13:30,863 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 (6)] Waiting until timeout for monitored process [2024-11-07 09:13:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:31,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 09:13:31,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 09:13:32,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:32,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:32,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490890857] [2024-11-07 09:13:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490890857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 09:13:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447459190] [2024-11-07 09:13:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:32,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:13:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:13:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:13:32,454 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:33,632 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-07 09:13:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 09:13:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-07 09:13:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:33,640 INFO L225 Difference]: With dead ends: 108 [2024-11-07 09:13:33,640 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 09:13:33,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-07 09:13:33,641 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:33,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 174 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 09:13:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 09:13:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-07 09:13:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.087719298245614) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:13:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-07 09:13:33,664 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 41 [2024-11-07 09:13:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-07 09:13:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-07 09:13:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 09:13:33,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:33,667 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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:13:33,679 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 (6)] Ended with exit code 0 [2024-11-07 09:13:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 09:13:33,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:33,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash -351497812, now seen corresponding path program 1 times [2024-11-07 09:13:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894112477] [2024-11-07 09:13:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:33,868 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 09:13:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:33,871 INFO L229 MonitoredProcess]: Starting monitored process 7 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 09:13:33,872 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 (7)] Waiting until timeout for monitored process [2024-11-07 09:13:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:33,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 09:13:33,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 09:13:34,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:13:41,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894112477] [2024-11-07 09:13:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894112477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 09:13:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123171617] [2024-11-07 09:13:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 09:13:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 09:13:41,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 09:13:41,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 09:13:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:42,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 09:13:42,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 09:13:48,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2123171617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:48,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 09:13:48,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2024-11-07 09:13:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733631321] [2024-11-07 09:13:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 09:13:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 09:13:48,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-07 09:13:48,023 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:53,163 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-07 09:13:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 09:13:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-07 09:13:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:53,165 INFO L225 Difference]: With dead ends: 88 [2024-11-07 09:13:53,165 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 09:13:53,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-07 09:13:53,170 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:53,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 09:13:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 09:13:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2024-11-07 09:13:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:13:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-07 09:13:53,181 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 41 [2024-11-07 09:13:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-07 09:13:53,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-07 09:13:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 09:13:53,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:53,183 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:13:53,189 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 (7)] Ended with exit code 0 [2024-11-07 09:13:53,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-07 09:13:53,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 09:13:53,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -102877155, now seen corresponding path program 1 times [2024-11-07 09:13:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:53,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272150061] [2024-11-07 09:13:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:53,590 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 09:13:53,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:53,593 INFO L229 MonitoredProcess]: Starting monitored process 9 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 09:13:53,595 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 (9)] Waiting until timeout for monitored process [2024-11-07 09:13:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:53,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 09:13:53,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-07 09:13:54,545 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:54,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:54,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272150061] [2024-11-07 09:13:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272150061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:54,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:13:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690754014] [2024-11-07 09:13:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:13:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:54,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:13:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:13:54,547 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:55,097 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-07 09:13:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:13:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2024-11-07 09:13:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:55,104 INFO L225 Difference]: With dead ends: 92 [2024-11-07 09:13:55,105 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 09:13:55,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:13:55,105 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:55,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 09:13:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 09:13:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2024-11-07 09:13:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:13:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-11-07 09:13:55,118 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 78 [2024-11-07 09:13:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:55,118 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-11-07 09:13:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 09:13:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-11-07 09:13:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 09:13:55,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:55,119 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:13:55,127 INFO L540 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 (9)] Forceful destruction successful, exit code 0 [2024-11-07 09:13:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 09:13:55,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -101030113, now seen corresponding path program 1 times [2024-11-07 09:13:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135877399] [2024-11-07 09:13:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:55,326 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 09:13:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:55,331 INFO L229 MonitoredProcess]: Starting monitored process 10 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 09:13:55,333 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 (10)] Waiting until timeout for monitored process [2024-11-07 09:13:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:55,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 09:13:55,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:13:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-07 09:13:58,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:13:58,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:13:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135877399] [2024-11-07 09:13:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135877399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:13:58,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:13:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:13:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153768669] [2024-11-07 09:13:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:13:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:13:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:13:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:13:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:13:58,380 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:13:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:13:59,100 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-11-07 09:13:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:13:59,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-11-07 09:13:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:13:59,109 INFO L225 Difference]: With dead ends: 156 [2024-11-07 09:13:59,109 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 09:13:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:13:59,109 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 09:13:59,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 09:13:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 09:13:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-07 09:13:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.0740740740740742) internal successors, (87), 82 states have internal predecessors, (87), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:13:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-07 09:13:59,133 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 78 [2024-11-07 09:13:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:13:59,134 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-07 09:13:59,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 09:13:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-07 09:13:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 09:13:59,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:13:59,142 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:13:59,150 INFO L540 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 09:13:59,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 09:13:59,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:13:59,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:13:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash 147116381, now seen corresponding path program 1 times [2024-11-07 09:13:59,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:13:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023810537] [2024-11-07 09:13:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:13:59,345 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 09:13:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:13:59,347 INFO L229 MonitoredProcess]: Starting monitored process 11 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 09:13:59,349 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 (11)] Waiting until timeout for monitored process [2024-11-07 09:13:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:13:59,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 09:13:59,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:14:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-07 09:14:04,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:14:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 09:14:07,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:14:07,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023810537] [2024-11-07 09:14:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023810537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:14:07,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:14:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 09:14:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079991472] [2024-11-07 09:14:07,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:14:07,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:14:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:14:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:14:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:14:07,122 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:14:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:14:10,452 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2024-11-07 09:14:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:14:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 78 [2024-11-07 09:14:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:14:10,458 INFO L225 Difference]: With dead ends: 186 [2024-11-07 09:14:10,458 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:14:10,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:14:10,463 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:14:10,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 09:14:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:14:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:14:10,466 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:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:14:10,467 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-07 09:14:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:14:10,467 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:14:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 09:14:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:14:10,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:14:10,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:14:10,483 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 (11)] Ended with exit code 0 [2024-11-07 09:14:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 09:14:10,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:14:10,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:14:22,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:14:22,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,842 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-07 09:14:22,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-07 09:14:22,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:14:22 BoogieIcfgContainer [2024-11-07 09:14:22,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:14:22,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:14:22,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:14:22,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:14:22,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:13:27" (3/4) ... [2024-11-07 09:14:22,848 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:14:22,852 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:14:22,854 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 09:14:22,855 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 09:14:22,855 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:14:22,855 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:14:22,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:14:22,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:14:22,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:14:22,909 INFO L158 Benchmark]: Toolchain (without parser) took 56444.91ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 59.7MB in the beginning and 133.0MB in the end (delta: -73.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,909 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:14:22,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.10ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 47.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.44ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 46.3MB in the end (delta: 981.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,909 INFO L158 Benchmark]: Boogie Preprocessor took 34.86ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:14:22,909 INFO L158 Benchmark]: RCFGBuilder took 441.27ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 33.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,910 INFO L158 Benchmark]: TraceAbstraction took 55654.46ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 33.0MB in the beginning and 137.6MB in the end (delta: -104.6MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,910 INFO L158 Benchmark]: Witness Printer took 61.71ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 133.0MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:14:22,911 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.65ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.10ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 47.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.44ms. Allocated memory is still 83.9MB. Free memory was 47.3MB in the beginning and 46.3MB in the end (delta: 981.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.86ms. Allocated memory is still 83.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 441.27ms. Allocated memory is still 83.9MB. Free memory was 44.7MB in the beginning and 33.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 55654.46ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 33.0MB in the beginning and 137.6MB in the end (delta: -104.6MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 61.71ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 133.0MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.4s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 922 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 629 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 293 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 582 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 65, 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, 9 MinimizatonAttempts, 61 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 2954 SizeOfPredicates, 51 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 1085/1104 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: 60]: Loop Invariant Derived loop invariant: (var_1_3 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((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)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:14:22,992 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