./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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/double_req_bl_1231b.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', 'b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b'] 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/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:01:02,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:01:02,340 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:01:02,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:01:02,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:01:02,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:01:02,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:01:02,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:01:02,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:01:02,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:01:02,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:01:02,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:01:02,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:01:02,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:01:02,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:01:02,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:01:02,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:02,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:01:02,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:01:02,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:01:02,371 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2024-11-06 21:01:02,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:01:02,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:01:02,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:01:02,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:01:02,594 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:01:02,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-11-06 21:01:03,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:01:03,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:01:03,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-11-06 21:01:03,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d747fbb49/2b8c2a8215e746c4960f91b574fdd8f4/FLAG3ed99a7aa [2024-11-06 21:01:04,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d747fbb49/2b8c2a8215e746c4960f91b574fdd8f4 [2024-11-06 21:01:04,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:01:04,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:01:04,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:04,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:01:04,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:01:04,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6830fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04, skipping insertion in model container [2024-11-06 21:01:04,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:01:04,318 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/double_req_bl_1231b.c[1765,1778] [2024-11-06 21:01:04,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:04,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:01:04,340 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/double_req_bl_1231b.c[1765,1778] [2024-11-06 21:01:04,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:04,350 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:01:04,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04 WrapperNode [2024-11-06 21:01:04,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:04,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:04,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:01:04,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:01:04,356 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:01:04" (1/1) ... [2024-11-06 21:01:04,362 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:01:04" (1/1) ... [2024-11-06 21:01:04,376 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2024-11-06 21:01:04,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:04,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:01:04,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:01:04,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:01:04,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,395 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-06 21:01:04,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:01:04,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:01:04,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:01:04,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:01:04,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (1/1) ... [2024-11-06 21:01:04,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:01:04,439 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:01:04,443 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:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-06 21:01:04,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-06 21:01:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:01:04,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:01:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 21:01:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 21:01:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:01:04,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:01:04,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:01:04,669 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-06 21:01:04,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:01:04,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:01:04,677 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 21:01:04,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:04 BoogieIcfgContainer [2024-11-06 21:01:04,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:01:04,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:01:04,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:01:04,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:01:04,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:04" (1/3) ... [2024-11-06 21:01:04,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10425c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:04, skipping insertion in model container [2024-11-06 21:01:04,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:04" (2/3) ... [2024-11-06 21:01:04,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10425c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:04, skipping insertion in model container [2024-11-06 21:01:04,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:04" (3/3) ... [2024-11-06 21:01:04,686 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2024-11-06 21:01:04,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:01:04,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:01:04,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:01:04,747 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;@3c0d71da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:01:04,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:01:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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:01:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:01:04,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:04,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:04,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -419185147, now seen corresponding path program 1 times [2024-11-06 21:01:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889485739] [2024-11-06 21:01:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 21:01:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:04,909 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:01:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889485739] [2024-11-06 21:01:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889485739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 21:01:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625562458] [2024-11-06 21:01:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:04,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 21:01:04,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 21:01:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 21:01:04,929 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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.333333333333333) internal successors, (13), 2 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:01:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:04,963 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2024-11-06 21:01:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 21:01:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:01:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:04,969 INFO L225 Difference]: With dead ends: 49 [2024-11-06 21:01:04,969 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 21:01:04,970 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:01:04,972 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:04,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 21:01:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-06 21:01:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:01:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-06 21:01:04,993 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2024-11-06 21:01:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:04,993 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-06 21:01:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:01:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-06 21:01:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:01:04,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:04,995 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:01:04,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 21:01:04,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:04,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2118859842, now seen corresponding path program 1 times [2024-11-06 21:01:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328918642] [2024-11-06 21:01:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 21:01:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,192 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:01:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:05,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328918642] [2024-11-06 21:01:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328918642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792059608] [2024-11-06 21:01:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:05,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:05,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:05,194 INFO L87 Difference]: Start difference. First operand 23 states and 29 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:01:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:05,218 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-06 21:01:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:05,219 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:01:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:05,220 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:05,220 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:01:05,221 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:01:05,221 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:05,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:01:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 21:01:05,227 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, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-06 21:01:05,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 16 [2024-11-06 21:01:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-06 21:01:05,228 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:01:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-06 21:01:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:01:05,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:05,228 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:01:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 21:01:05,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:05,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1080178430, now seen corresponding path program 1 times [2024-11-06 21:01:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25730735] [2024-11-06 21:01:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 21:01:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,345 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:01:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25730735] [2024-11-06 21:01:05,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25730735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:05,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:05,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:05,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145409602] [2024-11-06 21:01:05,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:05,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:05,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:05,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:05,349 INFO L87 Difference]: Start difference. First operand 27 states and 34 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:01:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:05,378 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:05,379 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:01:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:05,379 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:05,379 INFO L226 Difference]: Without dead ends: 31 [2024-11-06 21:01:05,379 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:01:05,380 INFO L432 NwaCegarLoop]: 31 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, 108 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:01:05,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-06 21:01:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-06 21:01:05,386 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, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-06 21:01:05,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2024-11-06 21:01:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:05,387 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-06 21:01:05,387 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:01:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-06 21:01:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:01:05,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:05,389 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:01:05,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 21:01:05,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1210156990, now seen corresponding path program 1 times [2024-11-06 21:01:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791656111] [2024-11-06 21:01:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 21:01:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,481 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:01:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791656111] [2024-11-06 21:01:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791656111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786709] [2024-11-06 21:01:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:05,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:05,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:05,484 INFO L87 Difference]: Start difference. First operand 27 states and 34 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:01:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:05,513 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:05,513 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:01:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:05,514 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:05,514 INFO L226 Difference]: Without dead ends: 31 [2024-11-06 21:01:05,514 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:01:05,515 INFO L432 NwaCegarLoop]: 31 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, 108 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:01:05,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-06 21:01:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-06 21:01:05,520 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, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-06 21:01:05,522 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2024-11-06 21:01:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:05,522 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-06 21:01:05,522 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:01:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-06 21:01:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 21:01:05,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:05,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:05,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 21:01:05,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1872385022, now seen corresponding path program 1 times [2024-11-06 21:01:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282636692] [2024-11-06 21:01:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 21:01:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:05,637 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:01:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:01:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282636692] [2024-11-06 21:01:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282636692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:05,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:05,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:01:05,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914576941] [2024-11-06 21:01:05,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:01:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:01:05,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:01:05,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:01:05,639 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:01:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:05,665 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-06 21:01:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:01:05,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2024-11-06 21:01:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:05,666 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:05,667 INFO L226 Difference]: Without dead ends: 31 [2024-11-06 21:01:05,667 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:01:05,667 INFO L432 NwaCegarLoop]: 31 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, 108 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:01:05,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-06 21:01:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-06 21:01:05,671 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, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-06 21:01:05,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2024-11-06 21:01:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-06 21:01:05,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:01:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-06 21:01:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 21:01:05,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:05,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:05,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 21:01:05,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:05,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash -679771939, now seen corresponding path program 1 times [2024-11-06 21:01:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:01:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026600418] [2024-11-06 21:01:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:01:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:01:05,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:01:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:01:05,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 21:01:05,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:01:05,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:01:05,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 21:01:05,722 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 21:01:05,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:01:05,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:01:05 BoogieIcfgContainer [2024-11-06 21:01:05,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:01:05,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:01:05,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:01:05,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:01:05,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:04" (3/4) ... [2024-11-06 21:01:05,739 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 21:01:05,740 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:01:05,740 INFO L158 Benchmark]: Toolchain (without parser) took 1531.96ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 61.8MB in the end (delta: 23.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-06 21:01:05,741 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:05,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.37ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 73.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:05,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.57ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 72.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:05,741 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:05,741 INFO L158 Benchmark]: RCFGBuilder took 268.32ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 58.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:05,742 INFO L158 Benchmark]: TraceAbstraction took 1056.42ms. Allocated memory is still 109.1MB. Free memory was 58.1MB in the beginning and 61.9MB in the end (delta: -3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:05,742 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 109.1MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:05,743 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.15ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.37ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 73.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.57ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 72.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 71.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 268.32ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 58.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.42ms. Allocated memory is still 109.1MB. Free memory was 58.1MB in the beginning and 61.9MB in the end (delta: -3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 109.1MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 70]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\result=0] [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL, EXPR fmin_double(x, y) [L47] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967306] [L20] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L47] RET, EXPR __fpclassify_double(x) VAL [x=4294967306, y=4294967307] [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; VAL [\result=4294967307, x=4294967306] [L66] RET, EXPR fmin_double(x, y) [L66] double res = fmin_double(x, y); [L69] COND TRUE res != x [L70] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 152 mSDtfsCounter, 86 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=27occurred in iteration=0, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 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:01:05,764 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/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:01:07,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:01:07,469 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:01:07,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:01:07,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:01:07,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:01:07,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:01:07,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:01:07,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:01:07,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:01:07,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:01:07,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:01:07,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:01:07,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:01:07,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:07,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:01:07,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:01:07,502 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2024-11-06 21:01:07,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:01:07,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:01:07,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:01:07,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:01:07,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:01:07,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-11-06 21:01:08,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:01:09,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:01:09,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2024-11-06 21:01:09,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477fadd56/b217323abf4f4bdeae1691432d8fb4bd/FLAGd193ea013 [2024-11-06 21:01:09,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477fadd56/b217323abf4f4bdeae1691432d8fb4bd [2024-11-06 21:01:09,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:01:09,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:01:09,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:09,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:01:09,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:01:09,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601453cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09, skipping insertion in model container [2024-11-06 21:01:09,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:01:09,564 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/double_req_bl_1231b.c[1765,1778] [2024-11-06 21:01:09,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:09,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:01:09,589 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/double_req_bl_1231b.c[1765,1778] [2024-11-06 21:01:09,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:01:09,605 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:01:09,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09 WrapperNode [2024-11-06 21:01:09,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:01:09,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:09,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:01:09,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:01:09,613 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:01:09" (1/1) ... [2024-11-06 21:01:09,619 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:01:09" (1/1) ... [2024-11-06 21:01:09,628 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-06 21:01:09,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:01:09,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:01:09,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:01:09,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:01:09,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,651 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-06 21:01:09,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:01:09,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:01:09,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:01:09,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:01:09,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (1/1) ... [2024-11-06 21:01:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:01:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:01:09,700 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:01:09,702 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:01:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:01:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-06 21:01:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-06 21:01:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 21:01:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 21:01:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:01:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-06 21:01:09,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-06 21:01:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 21:01:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 21:01:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:01:09,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:01:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:01:09,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:01:09,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:01:09,902 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-06 21:01:09,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:01:09,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:01:09,908 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 21:01:09,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:09 BoogieIcfgContainer [2024-11-06 21:01:09,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:01:09,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:01:09,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:01:09,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:01:09,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:09" (1/3) ... [2024-11-06 21:01:09,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a869ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:09, skipping insertion in model container [2024-11-06 21:01:09,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:09" (2/3) ... [2024-11-06 21:01:09,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a869ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:09, skipping insertion in model container [2024-11-06 21:01:09,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:09" (3/3) ... [2024-11-06 21:01:09,916 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2024-11-06 21:01:09,927 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:01:09,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:01:09,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:01:09,964 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;@185aa1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:01:09,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:01:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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:01:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:01:09,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:09,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:09,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash -315010535, now seen corresponding path program 1 times [2024-11-06 21:01:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852696092] [2024-11-06 21:01:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:09,981 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:01:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:09,984 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:01:09,984 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:01:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:10,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 21:01:10,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:10,080 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:01:10,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:10,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852696092] [2024-11-06 21:01:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852696092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:10,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 21:01:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038327253] [2024-11-06 21:01:10,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 21:01:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 21:01:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 21:01:10,096 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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 6.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:01:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:10,105 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2024-11-06 21:01:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 21:01:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.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:01:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:10,109 INFO L225 Difference]: With dead ends: 45 [2024-11-06 21:01:10,109 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 21:01:10,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:01:10,113 INFO L432 NwaCegarLoop]: 32 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, 32 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:01:10,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 21:01:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-06 21:01:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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:01:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-06 21:01:10,132 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2024-11-06 21:01:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:10,132 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-06 21:01:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.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:01:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-11-06 21:01:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:01:10,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:10,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:10,137 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:01:10,334 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:01:10,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:10,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1327229704, now seen corresponding path program 1 times [2024-11-06 21:01:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:10,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904189465] [2024-11-06 21:01:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:10,336 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:01:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:10,338 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:01:10,339 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:01:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:10,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:10,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:10,452 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:01:10,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:10,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904189465] [2024-11-06 21:01:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904189465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:10,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051022674] [2024-11-06 21:01:10,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:10,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:10,454 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:01:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:10,471 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-06 21:01:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:01:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:10,473 INFO L225 Difference]: With dead ends: 28 [2024-11-06 21:01:10,473 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:01:10,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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:01:10,474 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 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:01:10,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:01:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-06 21:01:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:01:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:01:10,478 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-11-06 21:01:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:10,478 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:01:10,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:01:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:01:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:01:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:10,479 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:01:10,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 21:01:10,683 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:01:10,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2095904004, now seen corresponding path program 1 times [2024-11-06 21:01:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608872113] [2024-11-06 21:01:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:10,684 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:01:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:10,687 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:01:10,689 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:01:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:10,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:10,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:10,776 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:01:10,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:10,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608872113] [2024-11-06 21:01:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608872113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563125029] [2024-11-06 21:01:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:10,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:10,779 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:01:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:10,802 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:01:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:10,803 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:10,803 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:01:10,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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:01:10,805 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:10,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:01:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-06 21:01:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:01:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:01:10,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2024-11-06 21:01:10,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:10,809 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:01:10,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:01:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:01:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:01:10,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:10,810 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:01:10,813 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:01:11,010 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:01:11,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash -899956100, now seen corresponding path program 1 times [2024-11-06 21:01:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386562884] [2024-11-06 21:01:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:11,011 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:01:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:11,014 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:01:11,014 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:01:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:11,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:11,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:11,112 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:01:11,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:11,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386562884] [2024-11-06 21:01:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386562884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753958391] [2024-11-06 21:01:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:11,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:11,113 INFO L87 Difference]: Start difference. First operand 24 states and 31 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, (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:01:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:11,133 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:11,136 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, (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:01:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:11,136 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:11,136 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:01:11,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:01:11,137 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:11,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:01:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-06 21:01:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:01:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:01:11,143 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2024-11-06 21:01:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:11,143 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:01:11,143 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, (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:01:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:01:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:01:11,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:11,144 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:01:11,148 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 (5)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:11,344 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:01:11,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1069737984, now seen corresponding path program 1 times [2024-11-06 21:01:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861987836] [2024-11-06 21:01:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:11,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:11,349 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:01:11,350 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:01:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:11,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:11,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:11,425 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:01:11,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:11,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:11,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861987836] [2024-11-06 21:01:11,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861987836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:11,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:11,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150224557] [2024-11-06 21:01:11,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:11,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:11,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:11,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:11,427 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:01:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:11,444 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-06 21:01:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:01:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:11,445 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:11,445 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:01:11,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:01:11,446 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:11,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:01:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-06 21:01:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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:01:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:01:11,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2024-11-06 21:01:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:11,450 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:01:11,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:01:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:01:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:01:11,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:11,450 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:01:11,454 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:01:11,654 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:01:11,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1957241665, now seen corresponding path program 1 times [2024-11-06 21:01:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153067193] [2024-11-06 21:01:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:11,655 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:01:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:11,657 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:01:11,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 21:01:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:11,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-06 21:01:11,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:12,283 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:01:12,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:12,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:12,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153067193] [2024-11-06 21:01:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153067193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 21:01:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613729175] [2024-11-06 21:01:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:12,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 21:01:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 21:01:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-06 21:01:12,285 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:01:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:13,122 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-06 21:01:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 21:01:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:01:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:13,124 INFO L225 Difference]: With dead ends: 41 [2024-11-06 21:01:13,124 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 21:01:13,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-06 21:01:13,125 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:13,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 21:01:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-06 21:01:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 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:01:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-06 21:01:13,129 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2024-11-06 21:01:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-06 21:01:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:01:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-06 21:01:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 21:01:13,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:13,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:13,135 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 (7)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:13,335 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:01:13,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:13,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash -147482436, now seen corresponding path program 1 times [2024-11-06 21:01:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178657722] [2024-11-06 21:01:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:13,336 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:01:13,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:13,338 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:01:13,339 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:01:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:13,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 21:01:13,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:13,560 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:01:13,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:13,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178657722] [2024-11-06 21:01:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178657722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 21:01:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198308262] [2024-11-06 21:01:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 21:01:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 21:01:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 21:01:13,561 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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:01:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:13,787 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-06 21:01:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:01:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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:01:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:13,788 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:13,788 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:13,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:01:13,788 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:13,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 66 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:01:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-06 21:01:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 21:01:13,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-06 21:01:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:13,794 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 21:01:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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:01:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 21:01:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 21:01:13,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:13,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:13,800 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:01:13,995 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:01:13,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 53961836, now seen corresponding path program 1 times [2024-11-06 21:01:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583691910] [2024-11-06 21:01:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:13,997 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:01:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:13,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:14,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 21:01:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:14,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 21:01:14,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:14,221 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:01:14,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:14,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583691910] [2024-11-06 21:01:14,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583691910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:14,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:14,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 21:01:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214101970] [2024-11-06 21:01:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:14,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 21:01:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 21:01:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 21:01:14,223 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:01:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:14,496 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-06 21:01:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:01:14,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 24 [2024-11-06 21:01:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:14,497 INFO L225 Difference]: With dead ends: 33 [2024-11-06 21:01:14,497 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 21:01:14,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:01:14,498 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:14,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 21:01:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-06 21:01:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 21:01:14,504 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 24 [2024-11-06 21:01:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 21:01:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:01:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 21:01:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 21:01:14,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:14,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:14,510 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 (9)] Ended with exit code 0 [2024-11-06 21:01:14,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:14,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1258814400, now seen corresponding path program 1 times [2024-11-06 21:01:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23288078] [2024-11-06 21:01:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:14,706 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:01:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:14,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:14,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 21:01:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:14,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:01:14,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:14,925 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:01:14,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:14,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23288078] [2024-11-06 21:01:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23288078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:14,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:14,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 21:01:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870793965] [2024-11-06 21:01:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 21:01:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:14,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 21:01:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 21:01:14,927 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:01:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,132 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-06 21:01:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:01:15,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 25 [2024-11-06 21:01:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,133 INFO L225 Difference]: With dead ends: 35 [2024-11-06 21:01:15,133 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:01:15,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:01:15,134 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:01:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-06 21:01:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:01:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 21:01:15,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2024-11-06 21:01:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,138 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 21:01:15,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:01:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 21:01:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 21:01:15,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,144 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 (10)] Ended with exit code 0 [2024-11-06 21:01:15,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:15,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:15,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash -790414352, now seen corresponding path program 1 times [2024-11-06 21:01:15,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981945143] [2024-11-06 21:01:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:15,341 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:01:15,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:15,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:01:15,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 21:01:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:15,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 21:01:15,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:15,624 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:01:15,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:15,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981945143] [2024-11-06 21:01:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981945143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 21:01:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603434421] [2024-11-06 21:01:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:15,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 21:01:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 21:01:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 21:01:15,625 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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:01:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:15,824 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-06 21:01:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:01:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2024-11-06 21:01:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:15,825 INFO L225 Difference]: With dead ends: 31 [2024-11-06 21:01:15,825 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:01:15,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:01:15,826 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:15,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 21:01:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:01:15,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-06 21:01:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-06 21:01:15,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2024-11-06 21:01:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:15,829 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-06 21:01:15,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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:01:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-06 21:01:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 21:01:15,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:15,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:15,833 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 (11)] Forceful destruction successful, exit code 0 [2024-11-06 21:01:16,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:16,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 97089329, now seen corresponding path program 1 times [2024-11-06 21:01:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487366303] [2024-11-06 21:01:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:16,031 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:01:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:16,032 INFO L229 MonitoredProcess]: Starting monitored process 12 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:01:16,034 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 (12)] Waiting until timeout for monitored process [2024-11-06 21:01:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:16,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:01:16,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:16,103 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:01:16,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:16,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487366303] [2024-11-06 21:01:16,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487366303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:16,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:01:16,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:01:16,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082863196] [2024-11-06 21:01:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:01:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:01:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:01:16,105 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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:01:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:16,119 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-06 21:01:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:01:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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 26 [2024-11-06 21:01:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:16,120 INFO L225 Difference]: With dead ends: 27 [2024-11-06 21:01:16,120 INFO L226 Difference]: Without dead ends: 23 [2024-11-06 21:01:16,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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:01:16,121 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:16,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-06 21:01:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-06 21:01:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:01:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-06 21:01:16,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 26 [2024-11-06 21:01:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:16,124 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-06 21:01:16,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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:01:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-06 21:01:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 21:01:16,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:01:16,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:16,130 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 (12)] Ended with exit code 0 [2024-11-06 21:01:16,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:01:16,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:01:16,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:01:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 97029747, now seen corresponding path program 1 times [2024-11-06 21:01:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:01:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556004207] [2024-11-06 21:01:16,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:01:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:01:16,328 INFO L229 MonitoredProcess]: Starting monitored process 13 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:01:16,330 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 (13)] Waiting until timeout for monitored process [2024-11-06 21:01:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:16,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 21:01:16,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 21:01:16,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 21:01:17,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:01:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556004207] [2024-11-06 21:01:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556004207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 21:01:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336319908] [2024-11-06 21:01:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:01:17,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 21:01:17,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 21:01:17,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 21:01:17,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-06 21:01:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:01:17,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:01:17,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:01:17,517 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:01:17,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:01:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [336319908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:01:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 21:01:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-06 21:01:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693700034] [2024-11-06 21:01:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:01:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 21:01:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:01:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 21:01:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-06 21:01:17,519 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:01:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:01:17,568 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-06 21:01:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:01:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 26 [2024-11-06 21:01:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:01:17,569 INFO L225 Difference]: With dead ends: 23 [2024-11-06 21:01:17,569 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 21:01:17,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-06 21:01:17,569 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:01:17,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:01:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 21:01:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 21:01:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 21:01:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 21:01:17,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-06 21:01:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:01:17,570 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 21:01:17,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:01:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 21:01:17,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 21:01:17,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:01:17,579 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 (13)] Ended with exit code 0 [2024-11-06 21:01:17,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-06 21:01:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 21:01:17,977 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:01:17,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 21:01:18,549 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:01:18,578 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,580 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-06 21:01:18,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:01:18 BoogieIcfgContainer [2024-11-06 21:01:18,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:01:18,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:01:18,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:01:18,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:01:18,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:09" (3/4) ... [2024-11-06 21:01:18,586 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 21:01:18,589 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-06 21:01:18,593 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-06 21:01:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-06 21:01:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 21:01:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 21:01:18,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 21:01:18,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 21:01:18,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:01:18,650 INFO L158 Benchmark]: Toolchain (without parser) took 9196.32ms. Allocated memory is still 109.1MB. Free memory was 85.8MB in the beginning and 74.7MB in the end (delta: 11.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,651 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:18,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.35ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 73.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.07ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 72.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:01:18,652 INFO L158 Benchmark]: Boogie Preprocessor took 45.07ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,652 INFO L158 Benchmark]: RCFGBuilder took 233.62ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 58.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,652 INFO L158 Benchmark]: TraceAbstraction took 8672.35ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 79.1MB in the end (delta: -21.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,652 INFO L158 Benchmark]: Witness Printer took 66.69ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 74.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:01:18,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.17ms. Allocated memory is still 83.9MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.35ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 73.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.07ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 72.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.07ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 70.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 233.62ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 58.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8672.35ms. Allocated memory is still 109.1MB. Free memory was 57.5MB in the beginning and 79.1MB in the end (delta: -21.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 66.69ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 74.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 841 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 579 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 487 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 262 mSDtfsCounter, 487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 67, 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, 12 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 261 ConstructedInterpolants, 58 QuantifiedInterpolants, 1681 SizeOfPredicates, 22 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 37/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 19]: Procedure Contract for __fpclassify_double Derived contract for procedure __fpclassify_double. Ensures: ((((0 == \result) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) || ((((4 == \result) || (2 == \result)) || (3 == \result)) || (1 == \result))) RESULT: Ultimate proved your program to be correct! [2024-11-06 21:01:18,688 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 Result: TRUE