./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.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-81.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', '22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c'] 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-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:17:29,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:17:30,032 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:17:30,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:17:30,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:17:30,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:17:30,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:17:30,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:17:30,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:17:30,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:17:30,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:17:30,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:17:30,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:17:30,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:17:30,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:17:30,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:17:30,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:17:30,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:30,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:17:30,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:17:30,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:17:30,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:17:30,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:17:30,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:17:30,061 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2024-11-07 10:17:30,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:17:30,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:17:30,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:17:30,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:17:30,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:17:30,277 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-81.i [2024-11-07 10:17:31,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:17:31,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:17:31,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2024-11-07 10:17:31,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f31fc317/b4e63badfa0e4ee2b13ca2eee9173f02/FLAG0dfcdfa64 [2024-11-07 10:17:32,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f31fc317/b4e63badfa0e4ee2b13ca2eee9173f02 [2024-11-07 10:17:32,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:17:32,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:17:32,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:32,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:17:32,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:17:32,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69bb5916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32, skipping insertion in model container [2024-11-07 10:17:32,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:17:32,130 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-81.i[916,929] [2024-11-07 10:17:32,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:32,194 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:17:32,203 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-81.i[916,929] [2024-11-07 10:17:32,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:32,255 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:17:32,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32 WrapperNode [2024-11-07 10:17:32,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:32,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:32,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:17:32,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:17:32,262 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:17:32" (1/1) ... [2024-11-07 10:17:32,271 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:17:32" (1/1) ... [2024-11-07 10:17:32,299 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-11-07 10:17:32,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:32,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:17:32,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:17:32,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:17:32,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,336 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2024-11-07 10:17:32,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:17:32,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:17:32,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:17:32,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:17:32,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (1/1) ... [2024-11-07 10:17:32,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:32,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:17:32,396 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:17:32,399 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:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:17:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:17:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:17:32,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:17:32,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:17:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:17:32,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:17:32,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:17:33,028 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-07 10:17:33,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:17:33,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:17:33,037 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:17:33,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:33 BoogieIcfgContainer [2024-11-07 10:17:33,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:17:33,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:17:33,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:17:33,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:17:33,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:17:32" (1/3) ... [2024-11-07 10:17:33,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d903c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:33, skipping insertion in model container [2024-11-07 10:17:33,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:32" (2/3) ... [2024-11-07 10:17:33,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d903c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:33, skipping insertion in model container [2024-11-07 10:17:33,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:33" (3/3) ... [2024-11-07 10:17:33,045 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2024-11-07 10:17:33,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:17:33,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:17:33,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:17:33,109 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;@5d89198e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:17:33,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:17:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 10:17:33,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:33,121 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:33,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1051185616, now seen corresponding path program 1 times [2024-11-07 10:17:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954641119] [2024-11-07 10:17:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954641119] [2024-11-07 10:17:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954641119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:33,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:17:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264479641] [2024-11-07 10:17:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:17:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:17:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:33,557 INFO L87 Difference]: Start difference. First operand has 129 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 109 states have internal predecessors, (156), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:33,582 INFO L93 Difference]: Finished difference Result 251 states and 396 transitions. [2024-11-07 10:17:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:17:33,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2024-11-07 10:17:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:33,588 INFO L225 Difference]: With dead ends: 251 [2024-11-07 10:17:33,588 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 10:17:33,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:17:33,593 INFO L432 NwaCegarLoop]: 183 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, 183 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:17:33,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 10:17:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-07 10:17:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-07 10:17:33,636 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 148 [2024-11-07 10:17:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:33,637 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-07 10:17:33,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-11-07 10:17:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 10:17:33,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:33,640 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:17:33,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:33,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 480424780, now seen corresponding path program 1 times [2024-11-07 10:17:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665865336] [2024-11-07 10:17:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665865336] [2024-11-07 10:17:33,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665865336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:33,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:33,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:33,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116731226] [2024-11-07 10:17:33,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:33,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:33,997 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:34,046 INFO L93 Difference]: Finished difference Result 249 states and 366 transitions. [2024-11-07 10:17:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2024-11-07 10:17:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:34,049 INFO L225 Difference]: With dead ends: 249 [2024-11-07 10:17:34,049 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 10:17:34,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:17:34,050 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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:17:34,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 10:17:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-07 10:17:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 107 states have internal predecessors, (149), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-07 10:17:34,070 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 148 [2024-11-07 10:17:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-07 10:17:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-07 10:17:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 10:17:34,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:34,074 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:17:34,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1787567178, now seen corresponding path program 1 times [2024-11-07 10:17:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:34,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866223169] [2024-11-07 10:17:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866223169] [2024-11-07 10:17:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866223169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:34,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:34,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:34,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399520390] [2024-11-07 10:17:34,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:34,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:34,426 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:34,506 INFO L93 Difference]: Finished difference Result 334 states and 490 transitions. [2024-11-07 10:17:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:17:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2024-11-07 10:17:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:34,509 INFO L225 Difference]: With dead ends: 334 [2024-11-07 10:17:34,509 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 10:17:34,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:34,512 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 67 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:34,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 505 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 10:17:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2024-11-07 10:17:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 156 states have (on average 1.3525641025641026) internal successors, (211), 156 states have internal predecessors, (211), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:17:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-07 10:17:34,535 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 148 [2024-11-07 10:17:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:34,535 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-07 10:17:34,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-07 10:17:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:17:34,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:34,537 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:17:34,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1475164183, now seen corresponding path program 1 times [2024-11-07 10:17:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:34,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029542220] [2024-11-07 10:17:34,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029542220] [2024-11-07 10:17:34,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029542220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:34,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414795207] [2024-11-07 10:17:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:34,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:34,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:34,814 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:34,843 INFO L93 Difference]: Finished difference Result 321 states and 468 transitions. [2024-11-07 10:17:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:34,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-07 10:17:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:34,845 INFO L225 Difference]: With dead ends: 321 [2024-11-07 10:17:34,845 INFO L226 Difference]: Without dead ends: 197 [2024-11-07 10:17:34,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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:17:34,846 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 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:17:34,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-07 10:17:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-07 10:17:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.3481012658227849) internal successors, (213), 158 states have internal predecessors, (213), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:17:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 285 transitions. [2024-11-07 10:17:34,869 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 285 transitions. Word has length 149 [2024-11-07 10:17:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:34,870 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 285 transitions. [2024-11-07 10:17:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 285 transitions. [2024-11-07 10:17:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:17:34,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:34,873 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:17:34,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1465083952, now seen corresponding path program 1 times [2024-11-07 10:17:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180167842] [2024-11-07 10:17:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180167842] [2024-11-07 10:17:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180167842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353804567] [2024-11-07 10:17:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:35,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:35,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:35,187 INFO L87 Difference]: Start difference. First operand 197 states and 285 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:35,354 INFO L93 Difference]: Finished difference Result 382 states and 554 transitions. [2024-11-07 10:17:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-07 10:17:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:35,356 INFO L225 Difference]: With dead ends: 382 [2024-11-07 10:17:35,356 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 10:17:35,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:17:35,357 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 178 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:35,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 482 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 10:17:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 226. [2024-11-07 10:17:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 187 states have (on average 1.3636363636363635) internal successors, (255), 187 states have internal predecessors, (255), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:17:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2024-11-07 10:17:35,371 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 151 [2024-11-07 10:17:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:35,371 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2024-11-07 10:17:35,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2024-11-07 10:17:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:17:35,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:35,372 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:17:35,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:35,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 301019693, now seen corresponding path program 1 times [2024-11-07 10:17:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81917979] [2024-11-07 10:17:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81917979] [2024-11-07 10:17:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81917979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:36,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:36,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:17:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009503170] [2024-11-07 10:17:36,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:36,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:36,008 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:36,107 INFO L93 Difference]: Finished difference Result 453 states and 650 transitions. [2024-11-07 10:17:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:17:36,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-07 10:17:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:36,109 INFO L225 Difference]: With dead ends: 453 [2024-11-07 10:17:36,109 INFO L226 Difference]: Without dead ends: 317 [2024-11-07 10:17:36,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:17:36,110 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 79 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:36,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1036 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-07 10:17:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-11-07 10:17:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 271 states have (on average 1.3726937269372694) internal successors, (372), 272 states have internal predecessors, (372), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:17:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 448 transitions. [2024-11-07 10:17:36,125 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 448 transitions. Word has length 153 [2024-11-07 10:17:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:36,126 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 448 transitions. [2024-11-07 10:17:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 448 transitions. [2024-11-07 10:17:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:17:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:36,127 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:17:36,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 519874411, now seen corresponding path program 1 times [2024-11-07 10:17:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260178618] [2024-11-07 10:17:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:36,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:36,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260178618] [2024-11-07 10:17:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260178618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:36,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:17:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123117604] [2024-11-07 10:17:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:36,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:36,558 INFO L87 Difference]: Start difference. First operand 314 states and 448 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:36,678 INFO L93 Difference]: Finished difference Result 585 states and 835 transitions. [2024-11-07 10:17:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:17:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-07 10:17:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:36,681 INFO L225 Difference]: With dead ends: 585 [2024-11-07 10:17:36,683 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 10:17:36,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:17:36,684 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 71 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:36,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1006 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 10:17:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 346. [2024-11-07 10:17:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 303 states have (on average 1.3795379537953796) internal successors, (418), 304 states have internal predecessors, (418), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:17:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2024-11-07 10:17:36,708 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 153 [2024-11-07 10:17:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:36,709 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2024-11-07 10:17:36,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2024-11-07 10:17:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 10:17:36,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:36,711 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:36,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:17:36,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1513987377, now seen corresponding path program 1 times [2024-11-07 10:17:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54299253] [2024-11-07 10:17:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:17:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:17:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:17:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:17:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:17:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:17:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:17:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:17:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54299253] [2024-11-07 10:17:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54299253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:37,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:37,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:17:37,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140902637] [2024-11-07 10:17:37,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:37,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:37,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:37,120 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:37,211 INFO L93 Difference]: Finished difference Result 653 states and 926 transitions. [2024-11-07 10:17:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:17:37,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2024-11-07 10:17:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:37,214 INFO L225 Difference]: With dead ends: 653 [2024-11-07 10:17:37,214 INFO L226 Difference]: Without dead ends: 445 [2024-11-07 10:17:37,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:17:37,215 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 110 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:37,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 784 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-07 10:17:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 346. [2024-11-07 10:17:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 303 states have (on average 1.3795379537953796) internal successors, (418), 304 states have internal predecessors, (418), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:17:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2024-11-07 10:17:37,236 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 154 [2024-11-07 10:17:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:37,236 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2024-11-07 10:17:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2024-11-07 10:17:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:17:37,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:37,239 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:37,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:17:37,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:37,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1747615656, now seen corresponding path program 1 times [2024-11-07 10:17:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:37,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783625594] [2024-11-07 10:17:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:37,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:17:37,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:17:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:17:37,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:17:37,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:17:37,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:17:37,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:17:37,453 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:37,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:17:37,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:17:37 BoogieIcfgContainer [2024-11-07 10:17:37,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:17:37,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:17:37,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:17:37,538 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:17:37,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:33" (3/4) ... [2024-11-07 10:17:37,541 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:17:37,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:17:37,543 INFO L158 Benchmark]: Toolchain (without parser) took 5531.62ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 90.8MB in the beginning and 174.6MB in the end (delta: -83.9MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 10:17:37,543 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:37,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.31ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 75.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:17:37,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:37,544 INFO L158 Benchmark]: Boogie Preprocessor took 66.24ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:17:37,544 INFO L158 Benchmark]: RCFGBuilder took 670.09ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 73.4MB in the end (delta: -7.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-07 10:17:37,544 INFO L158 Benchmark]: TraceAbstraction took 4498.57ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 73.0MB in the beginning and 174.7MB in the end (delta: -101.7MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2024-11-07 10:17:37,545 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 234.9MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 56.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:37,546 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.31ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.31ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 75.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.8MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.24ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 670.09ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 73.4MB in the end (delta: -7.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4498.57ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 73.0MB in the beginning and 174.7MB in the end (delta: -101.7MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 234.9MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 56.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of bitwiseOr at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L103] EXPR unsigned_short_int_Array_0[0][0] [L103] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] double_Array_0[2] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L82] EXPR double_Array_0[2] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] double_Array_0[3] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_)); VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] EXPR last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_) [L44] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] [L45] EXPR signed_char_Array_0[2] [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = (signed_char_Array_0[2] + signed_char_Array_0[0]) [L50] EXPR signed_char_Array_0[2] [L50] EXPR signed_char_Array_0[1] [L50] unsigned char stepLocal_1 = signed_char_Array_0[2] >= signed_char_Array_0[1]; [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L54] EXPR unsigned_short_int_Array_0[1][0] [L54] EXPR unsigned_short_int_Array_0[0][1] [L54] unsigned_short_int_Array_0[0][0] = ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]) [L56] EXPR signed_char_Array_0[1] [L56] signed char stepLocal_2 = signed_char_Array_0[1]; [L57] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_2 > unsigned_short_int_Array_0[1][0]) [L64] EXPR unsigned_short_int_Array_0[1][1] [L64] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR double_Array_0[3] [L67] EXPR double_Array_0[2] [L67] EXPR double_Array_0[1] [L67] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L67] EXPR double_Array_0[3] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[4] = ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 [L106] EXPR double_Array_0[4] [L106] EXPR double_Array_0[3] [L106] EXPR double_Array_0[2] [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L106] EXPR double_Array_0[2] [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106-L107] return (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 5060 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3508 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1552 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 194 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1196 ConstructedInterpolants, 0 QuantifiedInterpolants, 2403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 4896/4896 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:17:37,572 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-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:17:39,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:17:39,498 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:17:39,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:17:39,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:17:39,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:17:39,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:17:39,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:17:39,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:17:39,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:17:39,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:17:39,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:17:39,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:17:39,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:17:39,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:17:39,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:17:39,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:17:39,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:39,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:17:39,537 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:17:39,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:17:39,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:17:39,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:17:39,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:17:39,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:17:39,538 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2024-11-07 10:17:39,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:17:39,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:17:39,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:17:39,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:17:39,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:17:39,802 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-81.i [2024-11-07 10:17:41,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:17:41,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:17:41,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2024-11-07 10:17:41,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79f1fbbca/eccb6981ed27459a8502b263841b831c/FLAG39de9bc6e [2024-11-07 10:17:41,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79f1fbbca/eccb6981ed27459a8502b263841b831c [2024-11-07 10:17:41,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:17:41,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:17:41,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:41,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:17:41,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:17:41,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5cd6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41, skipping insertion in model container [2024-11-07 10:17:41,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:17:41,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-81.i[916,929] [2024-11-07 10:17:41,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:41,513 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:17:41,524 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-81.i[916,929] [2024-11-07 10:17:41,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:41,585 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:17:41,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41 WrapperNode [2024-11-07 10:17:41,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:41,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:41,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:17:41,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:17:41,593 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:17:41" (1/1) ... [2024-11-07 10:17:41,607 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:17:41" (1/1) ... [2024-11-07 10:17:41,654 INFO L138 Inliner]: procedures = 36, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 530 [2024-11-07 10:17:41,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:41,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:17:41,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:17:41,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:17:41,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,686 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2024-11-07 10:17:41,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:17:41,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:17:41,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:17:41,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:17:41,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (1/1) ... [2024-11-07 10:17:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:17:41,771 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:17:41,774 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:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:17:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:17:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:17:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:17:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:17:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:17:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:17:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:17:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:17:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:17:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:17:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:17:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:17:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:17:41,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:17:41,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:17:52,172 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-07 10:17:52,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:17:52,186 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:17:52,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:17:52,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:52 BoogieIcfgContainer [2024-11-07 10:17:52,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:17:52,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:17:52,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:17:52,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:17:52,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:17:41" (1/3) ... [2024-11-07 10:17:52,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65437d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:52, skipping insertion in model container [2024-11-07 10:17:52,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:41" (2/3) ... [2024-11-07 10:17:52,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65437d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:52, skipping insertion in model container [2024-11-07 10:17:52,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:52" (3/3) ... [2024-11-07 10:17:52,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2024-11-07 10:17:52,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:17:52,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:17:52,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:17:52,281 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;@23c029e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:17:52,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:17:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:17:52,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:52,295 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:52,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:52,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1314886186, now seen corresponding path program 1 times [2024-11-07 10:17:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112647683] [2024-11-07 10:17:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:52,311 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:17:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:52,314 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:17:52,315 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:17:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:52,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:17:52,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-07 10:17:52,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:52,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112647683] [2024-11-07 10:17:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112647683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:17:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533850667] [2024-11-07 10:17:52,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:52,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:17:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:52,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:17:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:52,674 INFO L87 Difference]: Start difference. First operand has 121 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:52,693 INFO L93 Difference]: Finished difference Result 235 states and 368 transitions. [2024-11-07 10:17:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:17:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2024-11-07 10:17:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:52,701 INFO L225 Difference]: With dead ends: 235 [2024-11-07 10:17:52,702 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 10:17:52,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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:17:52,706 INFO L432 NwaCegarLoop]: 169 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, 169 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:17:52,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 10:17:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-07 10:17:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-07 10:17:52,744 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 147 [2024-11-07 10:17:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:52,744 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-07 10:17:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-07 10:17:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:17:52,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:52,749 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:52,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:17:52,949 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:17:52,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1822295666, now seen corresponding path program 1 times [2024-11-07 10:17:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260548165] [2024-11-07 10:17:52,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:52,951 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:17:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:52,954 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:17:52,955 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:17:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:53,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:17:53,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 10:17:53,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:53,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260548165] [2024-11-07 10:17:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260548165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477268088] [2024-11-07 10:17:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:53,341 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:53,480 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2024-11-07 10:17:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2024-11-07 10:17:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:53,487 INFO L225 Difference]: With dead ends: 233 [2024-11-07 10:17:53,487 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:17:53,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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:17:53,488 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:53,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:17:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-07 10:17:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:17:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-07 10:17:53,498 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 147 [2024-11-07 10:17:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:53,499 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-07 10:17:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:17:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-07 10:17:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:17:53,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:53,501 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:53,516 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:17:53,701 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:17:53,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 575174864, now seen corresponding path program 1 times [2024-11-07 10:17:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212557158] [2024-11-07 10:17:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:53,703 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:17:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:53,705 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:17:53,706 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:17:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:53,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:17:53,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:55,346 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 33 treesize of output 15 [2024-11-07 10:17:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 10:17:55,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:17:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:56,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212557158] [2024-11-07 10:17:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212557158] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:17:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:17:56,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-07 10:17:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24596621] [2024-11-07 10:17:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:56,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:17:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:17:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:17:56,077 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:56,381 INFO L93 Difference]: Finished difference Result 292 states and 417 transitions. [2024-11-07 10:17:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:17:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:17:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:56,384 INFO L225 Difference]: With dead ends: 292 [2024-11-07 10:17:56,384 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 10:17:56,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:17:56,385 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 72 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:56,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 712 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:17:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 10:17:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-07 10:17:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 151 states have internal predecessors, (206), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:17:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2024-11-07 10:17:56,409 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 147 [2024-11-07 10:17:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:56,410 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2024-11-07 10:17:56,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2024-11-07 10:17:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:17:56,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:56,414 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:56,422 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:17:56,616 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:17:56,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash -242473586, now seen corresponding path program 1 times [2024-11-07 10:17:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748340585] [2024-11-07 10:17:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:56,621 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:17:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:56,623 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:17:56,625 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:17:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:56,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:17:56,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:56,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:56,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748340585] [2024-11-07 10:17:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748340585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642033588] [2024-11-07 10:17:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:56,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:56,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:56,928 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:57,000 INFO L93 Difference]: Finished difference Result 347 states and 495 transitions. [2024-11-07 10:17:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:17:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:57,003 INFO L225 Difference]: With dead ends: 347 [2024-11-07 10:17:57,003 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 10:17:57,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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:17:57,004 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:57,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 10:17:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 10:17:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 155 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:17:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-11-07 10:17:57,021 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 147 [2024-11-07 10:17:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-11-07 10:17:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-11-07 10:17:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:17:57,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:57,029 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:57,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:17:57,232 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:17:57,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1660098153, now seen corresponding path program 1 times [2024-11-07 10:17:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426797214] [2024-11-07 10:17:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:57,234 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:17:57,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:57,236 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:17:57,237 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:17:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:57,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:17:57,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 10:17:58,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:17:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:17:59,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426797214] [2024-11-07 10:17:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426797214] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:17:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:17:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-07 10:17:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105867747] [2024-11-07 10:17:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:59,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:17:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:17:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:17:59,197 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:59,455 INFO L93 Difference]: Finished difference Result 406 states and 571 transitions. [2024-11-07 10:17:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:17:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-07 10:17:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:59,457 INFO L225 Difference]: With dead ends: 406 [2024-11-07 10:17:59,457 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 10:17:59,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:17:59,458 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:59,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 584 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:17:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 10:17:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2024-11-07 10:17:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.3705882352941177) internal successors, (233), 171 states have internal predecessors, (233), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:17:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-11-07 10:17:59,467 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 149 [2024-11-07 10:17:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:59,468 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-11-07 10:17:59,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:17:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-11-07 10:17:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 10:17:59,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:59,469 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:59,487 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:17:59,670 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:17:59,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:59,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -417523518, now seen corresponding path program 1 times [2024-11-07 10:17:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279837237] [2024-11-07 10:17:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:59,671 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:17:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:59,675 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:17:59,676 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:18:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:00,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:18:00,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:00,115 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 17 treesize of output 9 [2024-11-07 10:18:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:18:02,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:02,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279837237] [2024-11-07 10:18:02,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279837237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:02,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:02,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:18:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259194821] [2024-11-07 10:18:02,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:02,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:18:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:18:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:18:02,136 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:18:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:03,470 INFO L93 Difference]: Finished difference Result 518 states and 733 transitions. [2024-11-07 10:18:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:18:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2024-11-07 10:18:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:03,473 INFO L225 Difference]: With dead ends: 518 [2024-11-07 10:18:03,473 INFO L226 Difference]: Without dead ends: 328 [2024-11-07 10:18:03,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:18:03,474 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 150 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:03,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 570 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:18:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-07 10:18:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 303. [2024-11-07 10:18:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.353846153846154) internal successors, (352), 261 states have internal predecessors, (352), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:18:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 428 transitions. [2024-11-07 10:18:03,489 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 428 transitions. Word has length 150 [2024-11-07 10:18:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 428 transitions. [2024-11-07 10:18:03,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:18:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 428 transitions. [2024-11-07 10:18:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:18:03,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:03,492 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:03,506 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:18:03,692 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:18:03,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 466454788, now seen corresponding path program 1 times [2024-11-07 10:18:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590200519] [2024-11-07 10:18:03,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:03,695 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:18:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:03,696 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:18:03,697 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:18:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:04,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:18:04,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:04,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:04,606 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 155 treesize of output 65 [2024-11-07 10:18:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 10:18:04,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:04,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590200519] [2024-11-07 10:18:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590200519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:18:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54260086] [2024-11-07 10:18:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:18:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:18:04,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:18:04,686 INFO L87 Difference]: Start difference. First operand 303 states and 428 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:09,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:14,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:15,012 INFO L93 Difference]: Finished difference Result 586 states and 830 transitions. [2024-11-07 10:18:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:18:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2024-11-07 10:18:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:15,025 INFO L225 Difference]: With dead ends: 586 [2024-11-07 10:18:15,026 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 10:18:15,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:18:15,027 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 148 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:15,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 519 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-11-07 10:18:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 10:18:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2024-11-07 10:18:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 261 states have internal predecessors, (350), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:18:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2024-11-07 10:18:15,049 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 151 [2024-11-07 10:18:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2024-11-07 10:18:15,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2024-11-07 10:18:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:18:15,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:15,053 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,073 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:18:15,253 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:18:15,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -896184192, now seen corresponding path program 1 times [2024-11-07 10:18:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285159264] [2024-11-07 10:18:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:15,254 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:18:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:15,256 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:18:15,257 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:18:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:15,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:18:15,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-07 10:18:15,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:15,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285159264] [2024-11-07 10:18:15,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285159264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:18:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870616883] [2024-11-07 10:18:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:15,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:18:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:18:15,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:18:15,931 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 10:18:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:16,446 INFO L93 Difference]: Finished difference Result 595 states and 837 transitions. [2024-11-07 10:18:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:18:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2024-11-07 10:18:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:16,449 INFO L225 Difference]: With dead ends: 595 [2024-11-07 10:18:16,449 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 10:18:16,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:18:16,450 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:16,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 687 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:18:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 10:18:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 303. [2024-11-07 10:18:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3384615384615384) internal successors, (348), 261 states have internal predecessors, (348), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:18:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2024-11-07 10:18:16,475 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 153 [2024-11-07 10:18:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2024-11-07 10:18:16,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 10:18:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2024-11-07 10:18:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:18:16,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:16,478 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,503 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:18:16,682 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:18:16,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1384231298, now seen corresponding path program 1 times [2024-11-07 10:18:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072307350] [2024-11-07 10:18:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:16,683 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:18:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:16,685 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:18:16,687 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:18:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:17,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:18:17,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:17,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:17,675 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 175 treesize of output 67 [2024-11-07 10:18:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-11-07 10:18:17,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:17,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:17,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072307350] [2024-11-07 10:18:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072307350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:17,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:18:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174018676] [2024-11-07 10:18:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:18:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:17,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:18:17,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:18:17,772 INFO L87 Difference]: Start difference. First operand 303 states and 424 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:21,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:26,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:27,016 INFO L93 Difference]: Finished difference Result 579 states and 813 transitions. [2024-11-07 10:18:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:18:27,024 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2024-11-07 10:18:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:27,026 INFO L225 Difference]: With dead ends: 579 [2024-11-07 10:18:27,026 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 10:18:27,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:18:27,026 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:27,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 511 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-07 10:18:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 10:18:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2024-11-07 10:18:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 260 states have (on average 1.3307692307692307) internal successors, (346), 261 states have internal predecessors, (346), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:18:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 422 transitions. [2024-11-07 10:18:27,039 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 422 transitions. Word has length 153 [2024-11-07 10:18:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:27,040 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 422 transitions. [2024-11-07 10:18:27,040 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 422 transitions. [2024-11-07 10:18:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:18:27,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:27,041 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,062 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:18:27,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:18:27,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:27,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -311535804, now seen corresponding path program 1 times [2024-11-07 10:18:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:27,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085879560] [2024-11-07 10:18:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:27,243 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:18:27,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:27,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:18:27,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:18:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:27,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:18:27,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:28,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:28,335 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 173 treesize of output 65 [2024-11-07 10:18:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 10:18:28,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:28,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085879560] [2024-11-07 10:18:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085879560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:18:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597313550] [2024-11-07 10:18:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:28,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:18:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:18:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:18:28,375 INFO L87 Difference]: Start difference. First operand 303 states and 422 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:33,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:34,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:37,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:41,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:43,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:43,837 INFO L93 Difference]: Finished difference Result 568 states and 795 transitions. [2024-11-07 10:18:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:18:43,844 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-11-07 10:18:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:43,846 INFO L225 Difference]: With dead ends: 568 [2024-11-07 10:18:43,846 INFO L226 Difference]: Without dead ends: 303 [2024-11-07 10:18:43,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:18:43,847 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 130 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:43,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 507 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2024-11-07 10:18:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-07 10:18:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2024-11-07 10:18:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.328125) internal successors, (340), 257 states have internal predecessors, (340), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:18:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 416 transitions. [2024-11-07 10:18:43,860 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 416 transitions. Word has length 155 [2024-11-07 10:18:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:43,860 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 416 transitions. [2024-11-07 10:18:43,860 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:18:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 416 transitions. [2024-11-07 10:18:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:18:43,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:43,861 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:43,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 10:18:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:18:44,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2106393852, now seen corresponding path program 1 times [2024-11-07 10:18:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856840080] [2024-11-07 10:18:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:44,065 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:18:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:44,067 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:18:44,069 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:18:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:44,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:18:44,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:45,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:45,198 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 172 treesize of output 64 [2024-11-07 10:18:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 24 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-07 10:18:45,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:18:45,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:45,974 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 110 treesize of output 1 [2024-11-07 10:18:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 10:18:46,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856840080] [2024-11-07 10:18:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856840080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:18:46,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:18:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-07 10:18:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708297376] [2024-11-07 10:18:46,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:18:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:18:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:18:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:18:46,037 INFO L87 Difference]: Start difference. First operand 299 states and 416 transitions. Second operand has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-07 10:18:51,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:53,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:59,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:19:03,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:19:05,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:19:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:19:06,241 INFO L93 Difference]: Finished difference Result 591 states and 818 transitions. [2024-11-07 10:19:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:19:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) Word has length 157 [2024-11-07 10:19:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:19:06,250 INFO L225 Difference]: With dead ends: 591 [2024-11-07 10:19:06,250 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 10:19:06,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:19:06,251 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 127 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:19:06,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 937 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 546 Invalid, 2 Unknown, 0 Unchecked, 19.7s Time] [2024-11-07 10:19:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 10:19:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2024-11-07 10:19:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3125) internal successors, (336), 257 states have internal predecessors, (336), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:19:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 412 transitions. [2024-11-07 10:19:06,266 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 412 transitions. Word has length 157 [2024-11-07 10:19:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:19:06,267 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 412 transitions. [2024-11-07 10:19:06,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.636363636363637) internal successors, (106), 12 states have internal predecessors, (106), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-07 10:19:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 412 transitions. [2024-11-07 10:19:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:19:06,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:19:06,276 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 10:19:06,476 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:19:06,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:19:06,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:19:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1565291842, now seen corresponding path program 1 times [2024-11-07 10:19:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:19:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991341688] [2024-11-07 10:19:06,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:19:06,477 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:19:06,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:19:06,479 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:19:06,480 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