./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:26,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:26,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:13:26,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:26,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:26,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:26,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:26,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:26,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:26,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:26,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:26,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:26,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:26,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:26,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:26,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:26,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:26,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:26,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:26,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:26,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:26,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:26,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:26,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:13:26,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:13:26,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:26,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:26,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:26,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:26,469 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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-07 10:13:26,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:26,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:26,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:26,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:26,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:26,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:28,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:28,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:28,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:28,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b0d394f2/418c3d9a93814537bafccae8cc8b9e52/FLAGb0a12e9ad [2024-11-07 10:13:28,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b0d394f2/418c3d9a93814537bafccae8cc8b9e52 [2024-11-07 10:13:28,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:28,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:28,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:28,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:28,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:28,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cc57ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28, skipping insertion in model container [2024-11-07 10:13:28,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:28,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-07 10:13:28,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:28,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:28,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-07 10:13:28,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:28,592 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:13:28,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28 WrapperNode [2024-11-07 10:13:28,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:28,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:28,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:13:28,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:13:28,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,659 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-07 10:13:28,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:28,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:13:28,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:13:28,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:13:28,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,692 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-07 10:13:28,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:13:28,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:13:28,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:13:28,742 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:13:28,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (1/1) ... [2024-11-07 10:13:28,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:28,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:28,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:13:28,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:13:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:13:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:13:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:13:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:13:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:13:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:13:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:13:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:13:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:13:28,808 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:13:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:13:28,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:13:28,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:13:28,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:13:29,522 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-07 10:13:29,523 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:13:29,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:13:29,537 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:13:29,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:29 BoogieIcfgContainer [2024-11-07 10:13:29,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:13:29,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:13:29,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:13:29,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:13:29,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:28" (1/3) ... [2024-11-07 10:13:29,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d02bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:29, skipping insertion in model container [2024-11-07 10:13:29,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:28" (2/3) ... [2024-11-07 10:13:29,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d02bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:29, skipping insertion in model container [2024-11-07 10:13:29,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:29" (3/3) ... [2024-11-07 10:13:29,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:29,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:13:29,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:13:29,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:13:29,633 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;@308c2fd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:13:29,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:13:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:29,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:29,659 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:29,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:29,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-07 10:13:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:29,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810751435] [2024-11-07 10:13:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:30,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:30,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810751435] [2024-11-07 10:13:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810751435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:30,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:30,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:13:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716663381] [2024-11-07 10:13:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:13:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:13:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:30,268 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:30,305 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-07 10:13:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:13:30,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-07 10:13:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:30,313 INFO L225 Difference]: With dead ends: 229 [2024-11-07 10:13:30,314 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:13:30,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:30,323 INFO L432 NwaCegarLoop]: 164 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, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:30,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:13:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 10:13:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-07 10:13:30,380 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-07 10:13:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:30,381 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-07 10:13:30,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-07 10:13:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:30,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:30,384 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:30,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:13:30,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:30,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-07 10:13:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:30,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769362535] [2024-11-07 10:13:30,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:30,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769362535] [2024-11-07 10:13:30,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769362535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:30,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67344525] [2024-11-07 10:13:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:30,872 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:30,936 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-07 10:13:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-07 10:13:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:30,939 INFO L225 Difference]: With dead ends: 227 [2024-11-07 10:13:30,939 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:13:30,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-07 10:13:30,940 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:30,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:13:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 10:13:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-07 10:13:30,952 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-07 10:13:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-07 10:13:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-07 10:13:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:30,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:30,960 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:13:30,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-07 10:13:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99911641] [2024-11-07 10:13:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:31,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:31,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99911641] [2024-11-07 10:13:31,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99911641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:31,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:31,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693114307] [2024-11-07 10:13:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:31,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:31,326 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:31,376 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-07 10:13:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:31,378 INFO L225 Difference]: With dead ends: 232 [2024-11-07 10:13:31,379 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:13:31,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-07 10:13:31,380 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:31,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:13:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-07 10:13:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-07 10:13:31,390 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2024-11-07 10:13:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:31,391 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-07 10:13:31,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-07 10:13:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:31,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:31,394 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:13:31,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1183161423, now seen corresponding path program 1 times [2024-11-07 10:13:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533452007] [2024-11-07 10:13:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533452007] [2024-11-07 10:13:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533452007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609081827] [2024-11-07 10:13:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:31,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:31,684 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:31,715 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-07 10:13:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:31,720 INFO L225 Difference]: With dead ends: 236 [2024-11-07 10:13:31,720 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 10:13:31,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-07 10:13:31,721 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:31,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 10:13:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-07 10:13:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-07 10:13:31,742 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2024-11-07 10:13:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-07 10:13:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-07 10:13:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:31,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:31,749 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:31,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:13:31,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1336798511, now seen corresponding path program 1 times [2024-11-07 10:13:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154483328] [2024-11-07 10:13:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:31,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154483328] [2024-11-07 10:13:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154483328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:31,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:31,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869996538] [2024-11-07 10:13:31,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:31,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:31,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:31,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:31,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:31,979 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:32,010 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-07 10:13:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:32,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:32,012 INFO L225 Difference]: With dead ends: 240 [2024-11-07 10:13:32,012 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 10:13:32,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-07 10:13:32,014 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:32,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 10:13:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-07 10:13:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-07 10:13:32,032 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 168 [2024-11-07 10:13:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:32,032 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-07 10:13:32,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-07 10:13:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:32,036 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:32,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:13:32,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:32,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1334951469, now seen corresponding path program 1 times [2024-11-07 10:13:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453919816] [2024-11-07 10:13:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:13:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:13:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:13:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:13:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:13:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:13:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:13:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:13:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:13:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:13:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:13:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:13:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:13:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:13:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:13:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:13:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:13:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:13:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:13:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:13:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 10:13:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:13:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453919816] [2024-11-07 10:13:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453919816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:13:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147870050] [2024-11-07 10:13:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:13:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:13:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:13:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:34,221 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 10:13:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:34,367 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-07 10:13:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:13:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2024-11-07 10:13:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:34,371 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:13:34,371 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:13:34,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:34,372 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:34,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 691 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:13:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:13:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:13:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-07 10:13:34,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-07 10:13:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:34,393 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-07 10:13:34,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 3 states have (on average 22.0) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 10:13:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-07 10:13:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:34,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:34,395 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:34,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:13:34,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-07 10:13:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:13:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404753044] [2024-11-07 10:13:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:34,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:13:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:34,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:13:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:13:34,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:13:34,720 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:13:34,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:13:34,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:13:34,726 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:34,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:13:34,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:13:34 BoogieIcfgContainer [2024-11-07 10:13:34,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:13:34,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:13:34,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:13:34,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:13:34,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:29" (3/4) ... [2024-11-07 10:13:34,864 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:13:34,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:13:34,865 INFO L158 Benchmark]: Toolchain (without parser) took 6577.70ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 76.0MB in the beginning and 102.6MB in the end (delta: -26.6MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,866 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:34,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.92ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 59.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.41ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 55.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:13:34,866 INFO L158 Benchmark]: Boogie Preprocessor took 79.96ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 50.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,867 INFO L158 Benchmark]: RCFGBuilder took 797.15ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 52.9MB in the end (delta: -2.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,867 INFO L158 Benchmark]: TraceAbstraction took 5320.20ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 52.5MB in the beginning and 102.7MB in the end (delta: -50.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,867 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 201.3MB. Free memory was 102.7MB in the beginning and 102.6MB in the end (delta: 31.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:13:34,869 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.43ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.92ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 59.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.41ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 55.3MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.96ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 50.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 797.15ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 52.9MB in the end (delta: -2.8MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5320.20ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 52.5MB in the beginning and 102.7MB in the end (delta: -50.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 201.3MB. Free memory was 102.7MB in the beginning and 102.6MB in the end (delta: 31.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2750 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1781 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 969 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 1043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5040/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:13:34,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:13:37,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:13:37,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:13:37,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:13:37,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:13:37,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:13:37,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:13:37,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:13:37,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:13:37,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:13:37,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:13:37,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:13:37,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:13:37,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:13:37,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:13:37,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:13:37,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:13:37,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:13:37,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:13:37,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:13:37,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:13:37,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:13:37,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:13:37,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:37,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:13:37,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:13:37,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:13:37,158 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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-11-07 10:13:37,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:13:37,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:13:37,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:13:37,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:13:37,476 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:13:37,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:38,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:13:39,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:13:39,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:39,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c3aaab8b/f9b3d242dd404b919a8caa393ff2edb8/FLAG612afcf8d [2024-11-07 10:13:39,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c3aaab8b/f9b3d242dd404b919a8caa393ff2edb8 [2024-11-07 10:13:39,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:13:39,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:13:39,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:39,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:13:39,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:13:39,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7776870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39, skipping insertion in model container [2024-11-07 10:13:39,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:13:39,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-07 10:13:39,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:39,295 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:13:39,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i[916,929] [2024-11-07 10:13:39,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:13:39,377 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:13:39,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39 WrapperNode [2024-11-07 10:13:39,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:13:39,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:39,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:13:39,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:13:39,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,451 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-07 10:13:39,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:13:39,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:13:39,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:13:39,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:13:39,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,496 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-11-07 10:13:39,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:13:39,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:13:39,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:13:39,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:13:39,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (1/1) ... [2024-11-07 10:13:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:13:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:13:39,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:13:39,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:13:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:13:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:13:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:13:39,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:13:39,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:13:39,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:13:39,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:13:39,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:13:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:13:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:13:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:13:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:13:39,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:13:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:13:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:13:39,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:13:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:13:39,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:13:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:13:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:13:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:13:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:13:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:13:39,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:13:39,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:13:41,168 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-07 10:13:41,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:13:41,184 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:13:41,185 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:13:41,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:41 BoogieIcfgContainer [2024-11-07 10:13:41,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:13:41,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:13:41,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:13:41,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:13:41,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:13:39" (1/3) ... [2024-11-07 10:13:41,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1904aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:41, skipping insertion in model container [2024-11-07 10:13:41,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:13:39" (2/3) ... [2024-11-07 10:13:41,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1904aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:13:41, skipping insertion in model container [2024-11-07 10:13:41,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:13:41" (3/3) ... [2024-11-07 10:13:41,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-11-07 10:13:41,206 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:13:41,206 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:13:41,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:13:41,268 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;@1876d5f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:13:41,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:13:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:41,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:41,311 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:41,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:41,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1009184855, now seen corresponding path program 1 times [2024-11-07 10:13:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266766633] [2024-11-07 10:13:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:41,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:41,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:13:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:41,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:13:41,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-07 10:13:41,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:41,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266766633] [2024-11-07 10:13:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266766633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:41,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:13:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019662354] [2024-11-07 10:13:41,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:41,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:13:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:41,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:13:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:41,809 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:41,838 INFO L93 Difference]: Finished difference Result 229 states and 361 transitions. [2024-11-07 10:13:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:13:41,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-07 10:13:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:41,850 INFO L225 Difference]: With dead ends: 229 [2024-11-07 10:13:41,850 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:13:41,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:13:41,858 INFO L432 NwaCegarLoop]: 164 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, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:41,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:13:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 10:13:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-07 10:13:41,907 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2024-11-07 10:13:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:41,908 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-07 10:13:41,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-07 10:13:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:41,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:41,926 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:41,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:13:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:42,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1949683919, now seen corresponding path program 1 times [2024-11-07 10:13:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783870184] [2024-11-07 10:13:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:42,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:42,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:42,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:13:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:42,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:13:42,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-07 10:13:42,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:42,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783870184] [2024-11-07 10:13:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783870184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:13:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619389320] [2024-11-07 10:13:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:42,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:13:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:13:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:13:42,541 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:42,605 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-07 10:13:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:13:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-07 10:13:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:42,614 INFO L225 Difference]: With dead ends: 227 [2024-11-07 10:13:42,614 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:13:42,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 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-07 10:13:42,617 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:42,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:13:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 10:13:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-07 10:13:42,636 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2024-11-07 10:13:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:42,636 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-07 10:13:42,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-07 10:13:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:42,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:42,641 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:42,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:13:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:42,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 503103053, now seen corresponding path program 1 times [2024-11-07 10:13:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337763475] [2024-11-07 10:13:42,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:42,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:42,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:42,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:13:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:43,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:13:43,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-07 10:13:43,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:13:43,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2024-11-07 10:13:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2024-11-07 10:13:43,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:43,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2024-11-07 10:13:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-07 10:13:43,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:13:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 10:13:44,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337763475] [2024-11-07 10:13:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337763475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:13:44,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:13:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-07 10:13:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581027705] [2024-11-07 10:13:44,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:13:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:13:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:13:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:13:44,332 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-07 10:13:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:45,414 INFO L93 Difference]: Finished difference Result 358 states and 506 transitions. [2024-11-07 10:13:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 10:13:45,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 168 [2024-11-07 10:13:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:45,418 INFO L225 Difference]: With dead ends: 358 [2024-11-07 10:13:45,418 INFO L226 Difference]: Without dead ends: 245 [2024-11-07 10:13:45,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 323 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-11-07 10:13:45,419 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:45,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1160 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:13:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-07 10:13:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 122. [2024-11-07 10:13:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-07 10:13:45,436 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2024-11-07 10:13:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:45,436 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-07 10:13:45,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.181818181818182) internal successors, (79), 13 states have internal predecessors, (79), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-07 10:13:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-07 10:13:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:45,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:45,438 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:45,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:13:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:45,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:45,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1185840689, now seen corresponding path program 1 times [2024-11-07 10:13:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111798279] [2024-11-07 10:13:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:45,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:45,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:45,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:45,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:13:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:46,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:13:46,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:46,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:46,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:46,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111798279] [2024-11-07 10:13:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111798279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:13:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323202311] [2024-11-07 10:13:46,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:46,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:13:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:13:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:13:46,079 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:46,138 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-07 10:13:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:13:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:46,141 INFO L225 Difference]: With dead ends: 246 [2024-11-07 10:13:46,142 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 10:13:46,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 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-07 10:13:46,143 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:46,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 10:13:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-07 10:13:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2024-11-07 10:13:46,168 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2024-11-07 10:13:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:46,169 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2024-11-07 10:13:46,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2024-11-07 10:13:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:46,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:46,172 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:46,184 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-07 10:13:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:46,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -505782319, now seen corresponding path program 1 times [2024-11-07 10:13:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:46,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866246605] [2024-11-07 10:13:46,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:46,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:46,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:46,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:46,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:13:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:46,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:13:46,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:46,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:46,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866246605] [2024-11-07 10:13:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866246605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:46,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:13:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867066034] [2024-11-07 10:13:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:46,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:13:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:13:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:46,737 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:46,794 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2024-11-07 10:13:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:13:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:46,796 INFO L225 Difference]: With dead ends: 252 [2024-11-07 10:13:46,796 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 10:13:46,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:46,797 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:46,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:13:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 10:13:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2024-11-07 10:13:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2024-11-07 10:13:46,829 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2024-11-07 10:13:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:46,830 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2024-11-07 10:13:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2024-11-07 10:13:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:46,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:46,831 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:46,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:13:47,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:47,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:47,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1269225043, now seen corresponding path program 1 times [2024-11-07 10:13:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151754329] [2024-11-07 10:13:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:47,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:47,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:47,036 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:47,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:13:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:13:47,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:13:47,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:47,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151754329] [2024-11-07 10:13:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151754329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:13:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289117608] [2024-11-07 10:13:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:13:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:13:47,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:13:47,383 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:47,464 INFO L93 Difference]: Finished difference Result 256 states and 355 transitions. [2024-11-07 10:13:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:13:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2024-11-07 10:13:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:47,466 INFO L225 Difference]: With dead ends: 256 [2024-11-07 10:13:47,466 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:13:47,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:13:47,467 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:47,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:13:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:13:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 10:13:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-07 10:13:47,485 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 168 [2024-11-07 10:13:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:47,485 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-07 10:13:47,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:13:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-07 10:13:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 10:13:47,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:47,487 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:47,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:13:47,689 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-07 10:13:47,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:47,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1271072085, now seen corresponding path program 1 times [2024-11-07 10:13:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:47,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763874554] [2024-11-07 10:13:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:47,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:47,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:47,699 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-07 10:13:47,700 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-07 10:13:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:47,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:13:47,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:48,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:13:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-07 10:13:48,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:48,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763874554] [2024-11-07 10:13:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763874554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:13:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274107721] [2024-11-07 10:13:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:13:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:13:48,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:48,089 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:49,095 INFO L93 Difference]: Finished difference Result 258 states and 356 transitions. [2024-11-07 10:13:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:13:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2024-11-07 10:13:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:49,105 INFO L225 Difference]: With dead ends: 258 [2024-11-07 10:13:49,105 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:13:49,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:13:49,106 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:49,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 496 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:13:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:13:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 10:13:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 106 states have internal predecessors, (136), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2024-11-07 10:13:49,118 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 168 [2024-11-07 10:13:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:49,118 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2024-11-07 10:13:49,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2024-11-07 10:13:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 10:13:49,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:49,120 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:49,132 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-07 10:13:49,320 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-07 10:13:49,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 639609807, now seen corresponding path program 1 times [2024-11-07 10:13:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598276925] [2024-11-07 10:13:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:49,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:49,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:13:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:49,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:13:49,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:49,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:13:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-11-07 10:13:49,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:13:49,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598276925] [2024-11-07 10:13:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598276925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:13:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:13:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:13:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076884995] [2024-11-07 10:13:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:13:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:13:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:13:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:13:49,786 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:13:50,863 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-11-07 10:13:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:13:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2024-11-07 10:13:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:13:50,873 INFO L225 Difference]: With dead ends: 258 [2024-11-07 10:13:50,873 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:13:50,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:13:50,874 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:13:50,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 494 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:13:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:13:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 10:13:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:13:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-07 10:13:50,885 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 170 [2024-11-07 10:13:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:13:50,885 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-07 10:13:50,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 10:13:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-07 10:13:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 10:13:50,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:13:50,888 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:13:50,901 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-07 10:13:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:51,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:13:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:13:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash -854207723, now seen corresponding path program 1 times [2024-11-07 10:13:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:13:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362921711] [2024-11-07 10:13:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:51,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:13:51,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:13:51,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:13:51,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:13:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:51,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:13:51,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:51,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:13:51,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:13:52,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:13:52,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:13:52,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:13:52,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-07 10:13:52,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:52,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-07 10:13:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-07 10:13:52,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:13:52,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:13:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362921711] [2024-11-07 10:13:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362921711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:13:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354168364] [2024-11-07 10:13:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:13:52,972 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:13:52,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:13:52,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:13:52,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-07 10:13:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:13:54,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:13:54,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:13:54,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:13:55,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:13:55,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:13:55,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:13:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:13:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:13:56,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:13:56,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-11-07 10:13:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-07 10:13:56,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:13:56,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1354168364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:13:56,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:13:56,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-07 10:13:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898293976] [2024-11-07 10:13:56,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:13:56,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:13:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:13:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:13:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:13:56,655 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 10:14:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:00,839 INFO L93 Difference]: Finished difference Result 379 states and 518 transitions. [2024-11-07 10:14:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:14:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2024-11-07 10:14:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:00,843 INFO L225 Difference]: With dead ends: 379 [2024-11-07 10:14:00,843 INFO L226 Difference]: Without dead ends: 252 [2024-11-07 10:14:00,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:14:00,844 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 549 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:00,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1164 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 10:14:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-07 10:14:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 208. [2024-11-07 10:14:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.274390243902439) internal successors, (209), 164 states have internal predecessors, (209), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2024-11-07 10:14:00,872 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 172 [2024-11-07 10:14:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:00,872 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2024-11-07 10:14:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 10:14:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2024-11-07 10:14:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 10:14:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:00,875 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-07 10:14:01,085 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-07 10:14:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:01,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1733125341, now seen corresponding path program 1 times [2024-11-07 10:14:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718520675] [2024-11-07 10:14:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:01,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:01,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:01,279 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-07 10:14:01,280 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-07 10:14:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:01,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:14:01,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:01,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2024-11-07 10:14:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-07 10:14:01,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:01,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-11-07 10:14:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 10:14:01,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718520675] [2024-11-07 10:14:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718520675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:14:01,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-07 10:14:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726270218] [2024-11-07 10:14:01,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:01,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:14:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:01,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:14:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:14:01,923 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-07 10:14:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:03,380 INFO L93 Difference]: Finished difference Result 428 states and 592 transitions. [2024-11-07 10:14:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:14:03,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 174 [2024-11-07 10:14:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:03,388 INFO L225 Difference]: With dead ends: 428 [2024-11-07 10:14:03,388 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 10:14:03,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:14:03,390 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:03,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 692 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:14:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 10:14:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2024-11-07 10:14:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 162 states have internal predecessors, (205), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2024-11-07 10:14:03,407 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 174 [2024-11-07 10:14:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:03,408 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2024-11-07 10:14:03,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-07 10:14:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2024-11-07 10:14:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 10:14:03,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:03,410 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:03,425 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 (12)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:03,610 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-07 10:14:03,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:03,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash 633954736, now seen corresponding path program 1 times [2024-11-07 10:14:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895410572] [2024-11-07 10:14:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:03,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:03,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:03,616 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-07 10:14:03,617 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-07 10:14:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:04,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:14:04,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:04,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:14:04,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:14:04,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:14:04,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:14:04,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:14:04,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-07 10:14:05,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:05,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 80 [2024-11-07 10:14:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-07 10:14:05,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:05,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895410572] [2024-11-07 10:14:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895410572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1333517522] [2024-11-07 10:14:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:14:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:14:05,366 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-07 10:14:05,367 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-07 10:14:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:07,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:14:07,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:07,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:14:07,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:14:07,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:14:07,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:14:08,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-11-07 10:14:08,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:14:08,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:08,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-11-07 10:14:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-11-07 10:14:08,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1333517522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:08,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-07 10:14:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530827084] [2024-11-07 10:14:08,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:14:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:14:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:14:08,950 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 10:14:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:12,673 INFO L93 Difference]: Finished difference Result 451 states and 619 transitions. [2024-11-07 10:14:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:14:12,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 174 [2024-11-07 10:14:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:12,676 INFO L225 Difference]: With dead ends: 451 [2024-11-07 10:14:12,676 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 10:14:12,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:14:12,677 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 563 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:12,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1224 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-07 10:14:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 10:14:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 208. [2024-11-07 10:14:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2024-11-07 10:14:12,702 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 174 [2024-11-07 10:14:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:12,703 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2024-11-07 10:14:12,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 16 states have internal predecessors, (135), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-07 10:14:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2024-11-07 10:14:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 10:14:12,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:12,705 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:12,719 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-07 10:14:12,920 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-07 10:14:13,106 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-07 10:14:13,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:13,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 156912928, now seen corresponding path program 1 times [2024-11-07 10:14:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125640628] [2024-11-07 10:14:13,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:13,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:13,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:13,110 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:13,111 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 (15)] Waiting until timeout for monitored process [2024-11-07 10:14:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:13,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:14:13,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:14:13,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:13,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125640628] [2024-11-07 10:14:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125640628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:13,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:13,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452599676] [2024-11-07 10:14:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:14:13,492 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:13,529 INFO L93 Difference]: Finished difference Result 416 states and 577 transitions. [2024-11-07 10:14:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2024-11-07 10:14:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:13,532 INFO L225 Difference]: With dead ends: 416 [2024-11-07 10:14:13,532 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 10:14:13,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 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-07 10:14:13,534 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:13,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:14:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 10:14:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-07 10:14:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 167 states have internal predecessors, (211), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2024-11-07 10:14:13,555 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 291 transitions. Word has length 174 [2024-11-07 10:14:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 291 transitions. [2024-11-07 10:14:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 291 transitions. [2024-11-07 10:14:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 10:14:13,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:13,559 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:13,573 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 (15)] Ended with exit code 0 [2024-11-07 10:14:13,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:13,760 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1388297179, now seen corresponding path program 1 times [2024-11-07 10:14:13,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898527327] [2024-11-07 10:14:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:13,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:13,764 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 (16)] Waiting until timeout for monitored process [2024-11-07 10:14:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:14,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:14:14,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:14,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:14:14,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:14,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:14,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:14,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:15,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-07 10:14:15,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:15,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-07 10:14:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-07 10:14:15,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:15,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898527327] [2024-11-07 10:14:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898527327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [826300032] [2024-11-07 10:14:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:15,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:14:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:14:15,248 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:14:15,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-07 10:14:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:16,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 10:14:16,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:17,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:14:17,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-07 10:14:17,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-07 10:14:17,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-07 10:14:17,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2024-11-07 10:14:18,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2024-11-07 10:14:18,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:18,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 78 [2024-11-07 10:14:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-07 10:14:18,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [826300032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:18,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:14:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-07 10:14:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090253606] [2024-11-07 10:14:18,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:14:18,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 10:14:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 10:14:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:14:18,491 INFO L87 Difference]: Start difference. First operand 211 states and 291 transitions. Second operand has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-07 10:14:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:22,720 INFO L93 Difference]: Finished difference Result 482 states and 651 transitions. [2024-11-07 10:14:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 10:14:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 174 [2024-11-07 10:14:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:22,723 INFO L225 Difference]: With dead ends: 482 [2024-11-07 10:14:22,723 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 10:14:22,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 10:14:22,726 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 553 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:22,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1388 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 10:14:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 10:14:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2024-11-07 10:14:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 170 states have internal predecessors, (214), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2024-11-07 10:14:22,751 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 174 [2024-11-07 10:14:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:22,752 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2024-11-07 10:14:22,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-11-07 10:14:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2024-11-07 10:14:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:22,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:22,755 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:22,770 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 (16)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:22,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-07 10:14:23,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:14:23,155 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:23,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1422318221, now seen corresponding path program 1 times [2024-11-07 10:14:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432515180] [2024-11-07 10:14:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:23,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:23,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:23,161 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:23,162 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 (18)] Waiting until timeout for monitored process [2024-11-07 10:14:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:23,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:14:23,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:23,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:14:23,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-11-07 10:14:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:14:23,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:23,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432515180] [2024-11-07 10:14:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432515180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:14:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897029509] [2024-11-07 10:14:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:23,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:14:23,578 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:23,872 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2024-11-07 10:14:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-07 10:14:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:23,876 INFO L225 Difference]: With dead ends: 371 [2024-11-07 10:14:23,876 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 10:14:23,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:23,877 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 130 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:23,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1052 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:14:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 10:14:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 218. [2024-11-07 10:14:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.254335260115607) internal successors, (217), 173 states have internal predecessors, (217), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:14:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2024-11-07 10:14:23,921 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 176 [2024-11-07 10:14:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:23,923 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2024-11-07 10:14:23,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2024-11-07 10:14:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:23,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:23,925 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:23,938 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 (18)] Forceful destruction successful, exit code 0 [2024-11-07 10:14:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:24,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1420471179, now seen corresponding path program 1 times [2024-11-07 10:14:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:24,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706290592] [2024-11-07 10:14:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:24,129 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:24,130 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 (19)] Waiting until timeout for monitored process [2024-11-07 10:14:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:24,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:14:24,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:24,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:24,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:14:24,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-07 10:14:24,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:24,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-07 10:14:24,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:24,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2024-11-07 10:14:24,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-07 10:14:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-07 10:14:25,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:25,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706290592] [2024-11-07 10:14:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706290592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:25,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:14:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603958263] [2024-11-07 10:14:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:14:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:14:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:25,062 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 10:14:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:25,559 INFO L93 Difference]: Finished difference Result 544 states and 743 transitions. [2024-11-07 10:14:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-07 10:14:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:25,562 INFO L225 Difference]: With dead ends: 544 [2024-11-07 10:14:25,562 INFO L226 Difference]: Without dead ends: 329 [2024-11-07 10:14:25,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:25,564 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 194 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:25,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 655 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:14:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-07 10:14:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-07 10:14:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 256 states have internal predecessors, (318), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 10:14:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 446 transitions. [2024-11-07 10:14:25,601 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 446 transitions. Word has length 176 [2024-11-07 10:14:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:25,602 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 446 transitions. [2024-11-07 10:14:25,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 10:14:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 446 transitions. [2024-11-07 10:14:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:25,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:25,603 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:25,614 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 (19)] Ended with exit code 0 [2024-11-07 10:14:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:25,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash 354536183, now seen corresponding path program 1 times [2024-11-07 10:14:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780940853] [2024-11-07 10:14:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:25,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:25,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:25,807 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:25,808 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 (20)] Waiting until timeout for monitored process [2024-11-07 10:14:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:26,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 10:14:26,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:26,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:14:26,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-07 10:14:26,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-07 10:14:26,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:26,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 40 [2024-11-07 10:14:26,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:14:26,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-11-07 10:14:26,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:26,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2024-11-07 10:14:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-07 10:14:26,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:26,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780940853] [2024-11-07 10:14:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780940853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:26,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:26,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:14:26,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19295353] [2024-11-07 10:14:26,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:14:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:26,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:14:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:26,672 INFO L87 Difference]: Start difference. First operand 327 states and 446 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 10:14:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:27,128 INFO L93 Difference]: Finished difference Result 568 states and 765 transitions. [2024-11-07 10:14:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 176 [2024-11-07 10:14:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:27,133 INFO L225 Difference]: With dead ends: 568 [2024-11-07 10:14:27,133 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 10:14:27,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:14:27,134 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 318 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:27,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 666 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:14:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 10:14:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2024-11-07 10:14:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 264 states have (on average 1.2386363636363635) internal successors, (327), 266 states have internal predecessors, (327), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 10:14:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2024-11-07 10:14:27,176 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 176 [2024-11-07 10:14:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:27,176 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2024-11-07 10:14:27,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-07 10:14:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2024-11-07 10:14:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:27,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:27,178 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:27,188 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 (20)] Ended with exit code 0 [2024-11-07 10:14:27,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:27,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:27,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1034594553, now seen corresponding path program 1 times [2024-11-07 10:14:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475387810] [2024-11-07 10:14:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:27,381 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:27,382 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 (21)] Waiting until timeout for monitored process [2024-11-07 10:14:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:27,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 10:14:27,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:27,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:14:28,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-11-07 10:14:28,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:28,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 35 [2024-11-07 10:14:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-11-07 10:14:28,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:14:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:14:28,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475387810] [2024-11-07 10:14:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475387810] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:14:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:14:28,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-07 10:14:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653749680] [2024-11-07 10:14:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:28,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:14:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:28,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:14:28,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:14:28,260 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:28,379 INFO L93 Difference]: Finished difference Result 633 states and 839 transitions. [2024-11-07 10:14:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:14:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-07 10:14:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:28,383 INFO L225 Difference]: With dead ends: 633 [2024-11-07 10:14:28,383 INFO L226 Difference]: Without dead ends: 402 [2024-11-07 10:14:28,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:14:28,384 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 38 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:28,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 778 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:14:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-07 10:14:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 376. [2024-11-07 10:14:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 297 states have (on average 1.2491582491582491) internal successors, (371), 299 states have internal predecessors, (371), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 10:14:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 507 transitions. [2024-11-07 10:14:28,436 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 507 transitions. Word has length 176 [2024-11-07 10:14:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:28,437 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 507 transitions. [2024-11-07 10:14:28,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 507 transitions. [2024-11-07 10:14:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:28,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:28,438 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:28,451 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 (21)] Ended with exit code 0 [2024-11-07 10:14:28,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:28,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:28,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 776429115, now seen corresponding path program 1 times [2024-11-07 10:14:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623231265] [2024-11-07 10:14:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:28,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:28,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:28,644 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:28,645 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 (22)] Waiting until timeout for monitored process [2024-11-07 10:14:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:28,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:14:28,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:29,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-07 10:14:29,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 10:14:29,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:29,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 34 [2024-11-07 10:14:29,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-07 10:14:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 10:14:29,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:14:29,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:14:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623231265] [2024-11-07 10:14:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623231265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:14:29,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:14:29,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:14:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670215848] [2024-11-07 10:14:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:14:29,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:14:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:14:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:14:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:14:29,324 INFO L87 Difference]: Start difference. First operand 376 states and 507 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:33,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:14:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:14:35,591 INFO L93 Difference]: Finished difference Result 611 states and 812 transitions. [2024-11-07 10:14:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:14:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2024-11-07 10:14:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:14:35,596 INFO L225 Difference]: With dead ends: 611 [2024-11-07 10:14:35,596 INFO L226 Difference]: Without dead ends: 347 [2024-11-07 10:14:35,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:14:35,598 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 95 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:14:35,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 672 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 10:14:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-07 10:14:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-07 10:14:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 266 states have (on average 1.2218045112781954) internal successors, (325), 268 states have internal predecessors, (325), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 10:14:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 461 transitions. [2024-11-07 10:14:35,647 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 461 transitions. Word has length 176 [2024-11-07 10:14:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:14:35,647 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 461 transitions. [2024-11-07 10:14:35,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 10:14:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 461 transitions. [2024-11-07 10:14:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 10:14:35,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:14:35,649 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:14:35,660 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 (22)] Ended with exit code 0 [2024-11-07 10:14:35,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:35,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:14:35,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:14:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -392417034, now seen corresponding path program 1 times [2024-11-07 10:14:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:14:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226525163] [2024-11-07 10:14:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:14:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:14:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:14:35,853 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:14:35,855 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 (23)] Waiting until timeout for monitored process [2024-11-07 10:14:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:14:36,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:14:36,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:14:37,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:14:40,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:41,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:42,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 30 [2024-11-07 10:14:50,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 63 [2024-11-07 10:14:51,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:14:51,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 78 [2024-11-07 10:14:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-07 10:14:53,152 INFO L311 TraceCheckSpWp]: Computing backward predicates...