./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c --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/float-newlib/float_req_bl_1232b.c', '-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', '6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68'] 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/float-newlib/float_req_bl_1232b.c -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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:10:00,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:10:00,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 21:10:00,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:10:00,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:10:00,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:10:00,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:10:00,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:10:00,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:10:00,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:10:00,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:10:00,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:10:00,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:10:00,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 21:10:00,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:10:00,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:10:00,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:00,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:10:00,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:10:00,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:10:00,744 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 -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-06 21:10:01,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:10:01,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:10:01,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:10:01,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:10:01,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:10:01,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-06 21:10:02,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:10:02,653 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:10:02,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-06 21:10:02,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abcef4c1b/1794c842da5247dd8c3fb7ae4151354d/FLAGf90f1c131 [2024-11-06 21:10:02,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abcef4c1b/1794c842da5247dd8c3fb7ae4151354d [2024-11-06 21:10:02,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:10:02,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:10:02,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:02,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:10:02,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:10:02,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ba7a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02, skipping insertion in model container [2024-11-06 21:10:02,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:10:02,878 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/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-06 21:10:02,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:02,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:10:02,920 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/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-06 21:10:02,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:02,935 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:10:02,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02 WrapperNode [2024-11-06 21:10:02,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:02,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:02,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:10:02,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:10:02,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,966 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-06 21:10:02,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:02,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:10:02,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:10:02,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:10:02,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:02,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,000 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-06 21:10:03,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,011 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:10:03,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:10:03,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:10:03,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:10:03,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (1/1) ... [2024-11-06 21:10:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:10:03,044 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-06 21:10:03,046 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-06 21:10:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:10:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 21:10:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 21:10:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 21:10:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:10:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-06 21:10:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-06 21:10:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-06 21:10:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-06 21:10:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-06 21:10:03,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:10:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:10:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 21:10:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 21:10:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 21:10:03,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:10:03,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:10:03,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:10:03,306 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-06 21:10:03,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:10:03,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:10:03,314 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 21:10:03,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:03 BoogieIcfgContainer [2024-11-06 21:10:03,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:10:03,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:10:03,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:10:03,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:10:03,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:02" (1/3) ... [2024-11-06 21:10:03,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52770e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:03, skipping insertion in model container [2024-11-06 21:10:03,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:02" (2/3) ... [2024-11-06 21:10:03,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52770e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:03, skipping insertion in model container [2024-11-06 21:10:03,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:03" (3/3) ... [2024-11-06 21:10:03,325 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-06 21:10:03,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:10:03,339 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:10:03,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:10:03,407 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;@19dc7525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:10:03,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:10:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:10:03,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:03,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:03,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-06 21:10:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556480745] [2024-11-06 21:10:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:03,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:03,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556480745] [2024-11-06 21:10:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556480745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:03,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 21:10:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075133524] [2024-11-06 21:10:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 21:10:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 21:10:03,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 21:10:03,663 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:03,707 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-06 21:10:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 21:10:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:10:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:03,715 INFO L225 Difference]: With dead ends: 55 [2024-11-06 21:10:03,716 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:10:03,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:10:03,722 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:03,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:10:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 21:10:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:10:03,758 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-06 21:10:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:10:03,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:10:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:10:03,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:03,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:03,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 21:10:03,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:03,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:03,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-06 21:10:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380095755] [2024-11-06 21:10:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:03,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380095755] [2024-11-06 21:10:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380095755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:04,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:04,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174002650] [2024-11-06 21:10:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,026 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:04,067 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-06 21:10:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:10:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:04,071 INFO L225 Difference]: With dead ends: 39 [2024-11-06 21:10:04,071 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:10:04,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,072 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:04,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:10:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-06 21:10:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:04,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-06 21:10:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:04,084 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:04,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:10:04,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:04,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:04,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 21:10:04,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:04,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-06 21:10:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491696390] [2024-11-06 21:10:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491696390] [2024-11-06 21:10:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491696390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269109882] [2024-11-06 21:10:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:04,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,281 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:04,316 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:04,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-06 21:10:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:04,317 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:04,317 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:04,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,318 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:04,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:04,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-06 21:10:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:04,328 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:04,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:10:04,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:04,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:04,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 21:10:04,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-06 21:10:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463815845] [2024-11-06 21:10:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:04,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463815845] [2024-11-06 21:10:04,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463815845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:04,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:04,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357857887] [2024-11-06 21:10:04,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:04,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,471 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:04,526 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:04,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 21:10:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:04,530 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:04,530 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:04,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,531 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:04,539 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-06 21:10:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:04,540 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:04,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:10:04,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:04,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:04,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 21:10:04,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-06 21:10:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434810910] [2024-11-06 21:10:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434810910] [2024-11-06 21:10:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434810910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589817830] [2024-11-06 21:10:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:04,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,672 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:04,709 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-06 21:10:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:04,713 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:04,713 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:04,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:04,714 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:04,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:04,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-06 21:10:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:04,720 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:04,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:10:04,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:04,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 21:10:04,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-06 21:10:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478932037] [2024-11-06 21:10:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:04,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:10:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:04,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 21:10:04,773 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:10:04,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:10:04,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 21:10:04,781 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 21:10:04,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:10:04,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:10:04 BoogieIcfgContainer [2024-11-06 21:10:04,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:10:04,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:10:04,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:10:04,808 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:10:04,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:03" (3/4) ... [2024-11-06 21:10:04,811 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 21:10:04,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:10:04,813 INFO L158 Benchmark]: Toolchain (without parser) took 2124.17ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 42.4MB in the end (delta: 34.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-06 21:10:04,814 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:04,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.06ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 64.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:04,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.76ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:04,815 INFO L158 Benchmark]: Boogie Preprocessor took 45.13ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 62.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:04,815 INFO L158 Benchmark]: RCFGBuilder took 301.29ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 49.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:04,815 INFO L158 Benchmark]: TraceAbstraction took 1490.38ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 42.4MB in the end (delta: 6.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-06 21:10:04,815 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 100.7MB. Free memory was 42.4MB in the beginning and 42.4MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:04,818 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.21ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.06ms. Allocated memory is still 100.7MB. Free memory was 76.3MB in the beginning and 64.9MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.76ms. Allocated memory is still 100.7MB. Free memory was 64.9MB in the beginning and 63.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.13ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 62.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 301.29ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 49.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1490.38ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 42.4MB in the end (delta: 6.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 100.7MB. Free memory was 42.4MB in the beginning and 42.4MB in the end (delta: 28.9kB). 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: 72]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryFLOAToperation at line 66. Possible FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578698] [L15] __uint32_t w; VAL [\old(x)=4286578698, x=4286578698] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=4286578698, \result=0, x=4286578698] [L38] RET, EXPR __fpclassify_float(x) VAL [x=4286578698, y=0] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=0, x=4286578698] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-06 21:10:04,847 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/float-newlib/float_req_bl_1232b.c -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 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:10:06,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:10:07,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 21:10:07,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:10:07,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:10:07,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:10:07,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:10:07,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:10:07,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:10:07,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:10:07,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:10:07,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:10:07,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:10:07,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:10:07,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 21:10:07,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:10:07,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:07,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:10:07,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:10:07,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:10:07,054 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 -> 6764d5c0204d5929259e99bbe2407d8f2018e402cda704b63da836202ebf4e68 [2024-11-06 21:10:07,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:10:07,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:10:07,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:10:07,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:10:07,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:10:07,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-06 21:10:08,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:10:08,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:10:08,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2024-11-06 21:10:08,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/259766071/c6b655fb6c214cd8bd6017aa0d33f293/FLAG20d20ed91 [2024-11-06 21:10:08,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/259766071/c6b655fb6c214cd8bd6017aa0d33f293 [2024-11-06 21:10:08,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:10:08,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:10:08,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:08,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:10:08,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:10:08,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:08" (1/1) ... [2024-11-06 21:10:08,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a65b798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:08, skipping insertion in model container [2024-11-06 21:10:08,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:08" (1/1) ... [2024-11-06 21:10:08,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:10:09,014 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/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-06 21:10:09,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:09,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:10:09,053 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/float-newlib/float_req_bl_1232b.c[1657,1670] [2024-11-06 21:10:09,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:09,073 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:10:09,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09 WrapperNode [2024-11-06 21:10:09,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:09,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:09,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:10:09,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:10:09,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,106 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-06 21:10:09,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:09,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:10:09,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:10:09,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:10:09,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,134 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-06 21:10:09,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:10:09,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:10:09,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:10:09,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:10:09,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:10:09,181 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-06 21:10:09,183 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-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-06 21:10:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-06 21:10:09,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:10:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 21:10:09,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:10:09,285 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:10:09,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:10:09,445 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-06 21:10:09,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:10:09,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:10:09,454 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 21:10:09,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:09 BoogieIcfgContainer [2024-11-06 21:10:09,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:10:09,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:10:09,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:10:09,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:10:09,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:08" (1/3) ... [2024-11-06 21:10:09,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2dbad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:09, skipping insertion in model container [2024-11-06 21:10:09,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (2/3) ... [2024-11-06 21:10:09,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2dbad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:09, skipping insertion in model container [2024-11-06 21:10:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:09" (3/3) ... [2024-11-06 21:10:09,463 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2024-11-06 21:10:09,474 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:10:09,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:10:09,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:10:09,526 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;@12f6a5ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:10:09,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:10:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 21:10:09,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:09,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:09,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-06 21:10:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419657472] [2024-11-06 21:10:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:09,555 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-06 21:10:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:09,559 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-06 21:10:09,561 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-06 21:10:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:09,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 21:10:09,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:09,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:09,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419657472] [2024-11-06 21:10:09,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419657472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:09,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:09,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 21:10:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284863000] [2024-11-06 21:10:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:09,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 21:10:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 21:10:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 21:10:09,737 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:09,753 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-06 21:10:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 21:10:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 21:10:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:09,762 INFO L225 Difference]: With dead ends: 51 [2024-11-06 21:10:09,762 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:10:09,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-06 21:10:09,766 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-06 21:10:09,767 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-06 21:10:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:10:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-06 21:10:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:10:09,799 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-06 21:10:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:10:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:10:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:10:09,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:09,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:09,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 21:10:10,006 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-06 21:10:10,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-06 21:10:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660174921] [2024-11-06 21:10:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,008 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-06 21:10:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:10,010 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-06 21:10:10,013 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-06 21:10:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:10:10,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:10,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:10,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660174921] [2024-11-06 21:10:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660174921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:10,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:10:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952845649] [2024-11-06 21:10:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:10,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:10:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:10:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:10,139 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:10,171 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-06 21:10:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:10:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:10:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:10,174 INFO L225 Difference]: With dead ends: 36 [2024-11-06 21:10:10,174 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:10:10,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:10,175 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:10,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:10:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 21:10:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-06 21:10:10,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-06 21:10:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:10,187 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-06 21:10:10,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-06 21:10:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:10:10,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,193 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 (3)] Forceful destruction successful, exit code 0 [2024-11-06 21:10:10,388 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-06 21:10:10,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-06 21:10:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572558276] [2024-11-06 21:10:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,390 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-06 21:10:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:10,393 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-06 21:10:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 21:10:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 21:10:10,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:10,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:10,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572558276] [2024-11-06 21:10:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572558276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:10:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652696505] [2024-11-06 21:10:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:10:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:10:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:10:10,642 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:10,811 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-06 21:10:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:10:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:10:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:10,812 INFO L225 Difference]: With dead ends: 49 [2024-11-06 21:10:10,812 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:10:10,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:10:10,814 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:10,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:10:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:10:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 21:10:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-06 21:10:10,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-06 21:10:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:10,821 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-06 21:10:10,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-06 21:10:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 21:10:10,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,827 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-06 21:10:11,023 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-06 21:10:11,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:11,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-06 21:10:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629018547] [2024-11-06 21:10:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:11,025 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-06 21:10:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:11,027 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-06 21:10:11,028 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-06 21:10:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:10:11,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:10:11,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:11,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629018547] [2024-11-06 21:10:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629018547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:10:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651044115] [2024-11-06 21:10:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:10:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:10:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:11,116 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:11,144 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-06 21:10:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:10:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-06 21:10:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:11,145 INFO L225 Difference]: With dead ends: 36 [2024-11-06 21:10:11,145 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:10:11,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:11,146 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:11,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:10:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 21:10:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-06 21:10:11,151 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-06 21:10:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-06 21:10:11,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-06 21:10:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 21:10:11,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:11,153 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:11,157 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-06 21:10:11,353 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-06 21:10:11,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-06 21:10:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:11,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494193070] [2024-11-06 21:10:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:11,355 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-06 21:10:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:11,357 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-06 21:10:11,366 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-06 21:10:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:10:11,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 21:10:11,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:11,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494193070] [2024-11-06 21:10:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494193070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077590908] [2024-11-06 21:10:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:11,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:11,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:11,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:11,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,491 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:11,527 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-06 21:10:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-06 21:10:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:11,528 INFO L225 Difference]: With dead ends: 32 [2024-11-06 21:10:11,528 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 21:10:11,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,529 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:11,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 21:10:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-06 21:10:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-06 21:10:11,532 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-06 21:10:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-06 21:10:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-06 21:10:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 21:10:11,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:11,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:11,537 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-06 21:10:11,737 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-06 21:10:11,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:11,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-06 21:10:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863785354] [2024-11-06 21:10:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:11,738 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-06 21:10:11,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:11,740 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-06 21:10:11,741 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-06 21:10:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:10:11,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 21:10:11,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:11,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863785354] [2024-11-06 21:10:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863785354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:11,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:11,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:10:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530008247] [2024-11-06 21:10:11,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:11,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:10:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:10:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:10:11,895 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:12,035 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-06 21:10:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:10:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-06 21:10:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:12,036 INFO L225 Difference]: With dead ends: 38 [2024-11-06 21:10:12,036 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 21:10:12,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:10:12,037 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:12,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:10:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 21:10:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-06 21:10:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-06 21:10:12,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-06 21:10:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:12,040 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-06 21:10:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-06 21:10:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 21:10:12,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:12,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:12,045 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-06 21:10:12,241 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 [2024-11-06 21:10:12,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:12,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-06 21:10:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953074540] [2024-11-06 21:10:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:12,242 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-06 21:10:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:12,244 INFO L229 MonitoredProcess]: Starting monitored process 8 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-06 21:10:12,245 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 (8)] Waiting until timeout for monitored process [2024-11-06 21:10:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:12,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:10:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:12,390 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 21:10:12,390 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:10:12,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:10:12,397 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 (8)] Ended with exit code 0 [2024-11-06 21:10:12,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-06 21:10:12,594 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:12,612 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:10:12,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:10:12 BoogieIcfgContainer [2024-11-06 21:10:12,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:10:12,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:10:12,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:10:12,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:10:12,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:09" (3/4) ... [2024-11-06 21:10:12,617 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 21:10:12,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 21:10:12,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:10:12,650 INFO L158 Benchmark]: Toolchain (without parser) took 3815.52ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 53.2MB in the end (delta: 8.0MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-06 21:10:12,650 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:12,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.56ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 49.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:12,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 47.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:12,652 INFO L158 Benchmark]: Boogie Preprocessor took 41.33ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 45.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:12,652 INFO L158 Benchmark]: RCFGBuilder took 304.50ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 33.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:12,652 INFO L158 Benchmark]: TraceAbstraction took 3157.63ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 55.4MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:12,652 INFO L158 Benchmark]: Witness Printer took 33.45ms. Allocated memory is still 83.9MB. Free memory was 55.4MB in the beginning and 53.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:12,654 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.56ms. Allocated memory is still 83.9MB. Free memory was 61.1MB in the beginning and 49.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 47.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.33ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 45.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 304.50ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 33.2MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3157.63ms. Allocated memory is still 83.9MB. Free memory was 32.6MB in the beginning and 55.4MB in the end (delta: -22.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.45ms. Allocated memory is still 83.9MB. Free memory was 55.4MB in the beginning and 53.2MB in the end (delta: 2.2MB). 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 - CounterExampleResult [Line: 72]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L66] float x = -0.0f; [L67] float y = 0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L38] COND FALSE !(__fpclassify_float(x) == 0) [L40] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L15] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND TRUE w == 0x00000000 || w == 0x80000000 [L24] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L40] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L40] COND FALSE !(__fpclassify_float(y) == 0) [L43] return x < y ? x : y; VAL [\result=0.0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=0.0] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] CALL, EXPR __signbit_float(res) [L47] __uint32_t w; VAL [x=0.0] [L50] ieee_float_shape_type gf_u; [L51] gf_u.value = (x) [L52] EXPR gf_u.word [L52] (w) = gf_u.word [L55] return (w & 0x80000000) != 0; VAL [\result=0, x=0.0] [L71] RET, EXPR __signbit_float(res) [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 29, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 280 SizeOfPredicates, 9 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2024-11-06 21:10:12,680 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE