./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.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-23.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', 'a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490'] 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-23.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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:26,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:26,226 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:10:26,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:26,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:26,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:26,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:26,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:26,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:26,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:26,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:26,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:26,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:26,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:26,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:26,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:26,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:26,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:26,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:26,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:26,259 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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-07 10:10:26,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:26,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:26,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:26,489 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:26,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:26,490 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-23.i [2024-11-07 10:10:27,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:27,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:27,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-07 10:10:27,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b687fd2d/21f4f4d245b44965904c62eee39c0b1f/FLAG0871ba893 [2024-11-07 10:10:28,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b687fd2d/21f4f4d245b44965904c62eee39c0b1f [2024-11-07 10:10:28,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:28,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:28,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:28,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:28,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:28,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3195e3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28, skipping insertion in model container [2024-11-07 10:10:28,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:28,313 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-23.i[916,929] [2024-11-07 10:10:28,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:28,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:28,399 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-23.i[916,929] [2024-11-07 10:10:28,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:28,462 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:28,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28 WrapperNode [2024-11-07 10:10:28,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:28,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:28,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:28,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:28,469 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:10:28" (1/1) ... [2024-11-07 10:10:28,477 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:10:28" (1/1) ... [2024-11-07 10:10:28,509 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2024-11-07 10:10:28,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:28,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:28,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:28,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:28,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,534 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-07 10:10:28,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:28,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:28,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:28,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:28,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (1/1) ... [2024-11-07 10:10:28,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:28,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:28,598 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:10:28,603 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:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:10:28,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:10:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:10:28,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:28,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:28,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:29,110 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:29,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:29,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:29,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:29,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:29 BoogieIcfgContainer [2024-11-07 10:10:29,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:29,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:29,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:29,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:29,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:28" (1/3) ... [2024-11-07 10:10:29,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6943a874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:29, skipping insertion in model container [2024-11-07 10:10:29,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:28" (2/3) ... [2024-11-07 10:10:29,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6943a874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:29, skipping insertion in model container [2024-11-07 10:10:29,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:29" (3/3) ... [2024-11-07 10:10:29,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-07 10:10:29,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:29,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:29,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:29,190 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;@12d886c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:29,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:10:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:29,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:29,206 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:29,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1186593926, now seen corresponding path program 1 times [2024-11-07 10:10:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481347886] [2024-11-07 10:10:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481347886] [2024-11-07 10:10:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481347886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:29,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474777943] [2024-11-07 10:10:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:29,567 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:29,623 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-07 10:10:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:10:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:29,632 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:10:29,632 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:10:29,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:10:29,638 INFO L432 NwaCegarLoop]: 176 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, 176 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:10:29,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:10:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:10:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:10:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:10:29,676 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-07 10:10:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:10:29,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:10:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:29,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:29,681 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:29,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:10:29,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1867100974, now seen corresponding path program 1 times [2024-11-07 10:10:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545794965] [2024-11-07 10:10:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545794965] [2024-11-07 10:10:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545794965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389222966] [2024-11-07 10:10:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:30,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:30,040 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:30,089 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-07 10:10:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:10:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:30,091 INFO L225 Difference]: With dead ends: 239 [2024-11-07 10:10:30,093 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:10:30,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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:10:30,094 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 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:10:30,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:10:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:10:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:10:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 10:10:30,112 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-07 10:10:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:30,113 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 10:10:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 10:10:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:30,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:30,116 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:10:30,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -24625260, now seen corresponding path program 1 times [2024-11-07 10:10:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949934495] [2024-11-07 10:10:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:31,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:31,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949934495] [2024-11-07 10:10:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949934495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:10:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926211073] [2024-11-07 10:10:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:10:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:10:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:10:31,457 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:32,175 INFO L93 Difference]: Finished difference Result 463 states and 679 transitions. [2024-11-07 10:10:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:10:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:10:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:32,178 INFO L225 Difference]: With dead ends: 463 [2024-11-07 10:10:32,179 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 10:10:32,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:10:32,180 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 380 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:32,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1727 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:10:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 10:10:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 243. [2024-11-07 10:10:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 202 states have (on average 1.400990099009901) internal successors, (283), 203 states have internal predecessors, (283), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:10:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 359 transitions. [2024-11-07 10:10:32,211 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 359 transitions. Word has length 165 [2024-11-07 10:10:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:32,211 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 359 transitions. [2024-11-07 10:10:32,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 359 transitions. [2024-11-07 10:10:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:32,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:32,215 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:10:32,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -611431274, now seen corresponding path program 1 times [2024-11-07 10:10:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998945603] [2024-11-07 10:10:32,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:33,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:33,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998945603] [2024-11-07 10:10:33,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998945603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:33,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:10:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125707998] [2024-11-07 10:10:33,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:33,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:10:33,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:10:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:33,261 INFO L87 Difference]: Start difference. First operand 243 states and 359 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:39,943 INFO L93 Difference]: Finished difference Result 646 states and 947 transitions. [2024-11-07 10:10:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:10:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:10:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:39,949 INFO L225 Difference]: With dead ends: 646 [2024-11-07 10:10:39,949 INFO L226 Difference]: Without dead ends: 406 [2024-11-07 10:10:39,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:10:39,951 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 363 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:39,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1108 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-07 10:10:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-07 10:10:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 311. [2024-11-07 10:10:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 252 states have (on average 1.373015873015873) internal successors, (346), 254 states have internal predecessors, (346), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:10:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2024-11-07 10:10:39,985 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 165 [2024-11-07 10:10:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:39,986 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2024-11-07 10:10:39,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2024-11-07 10:10:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:39,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:39,987 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:10:39,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:39,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -842273710, now seen corresponding path program 1 times [2024-11-07 10:10:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730111225] [2024-11-07 10:10:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730111225] [2024-11-07 10:10:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730111225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:10:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799614365] [2024-11-07 10:10:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:10:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:10:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:40,736 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:41,240 INFO L93 Difference]: Finished difference Result 563 states and 820 transitions. [2024-11-07 10:10:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:10:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:10:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:41,245 INFO L225 Difference]: With dead ends: 563 [2024-11-07 10:10:41,245 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 10:10:41,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:10:41,246 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 260 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:41,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1468 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:10:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 10:10:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 300. [2024-11-07 10:10:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 241 states have (on average 1.3651452282157677) internal successors, (329), 243 states have internal predecessors, (329), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:10:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 437 transitions. [2024-11-07 10:10:41,281 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 437 transitions. Word has length 165 [2024-11-07 10:10:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:41,281 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 437 transitions. [2024-11-07 10:10:41,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 437 transitions. [2024-11-07 10:10:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:41,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:41,284 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:10:41,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:41,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -158638766, now seen corresponding path program 1 times [2024-11-07 10:10:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387306579] [2024-11-07 10:10:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387306579] [2024-11-07 10:10:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387306579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:41,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:10:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499242006] [2024-11-07 10:10:41,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:41,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:10:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:10:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:10:41,868 INFO L87 Difference]: Start difference. First operand 300 states and 437 transitions. Second operand has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:42,196 INFO L93 Difference]: Finished difference Result 540 states and 782 transitions. [2024-11-07 10:10:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:10:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:10:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:42,198 INFO L225 Difference]: With dead ends: 540 [2024-11-07 10:10:42,200 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 10:10:42,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:42,201 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 143 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:42,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1292 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:10:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 10:10:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 240. [2024-11-07 10:10:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.365482233502538) internal successors, (269), 198 states have internal predecessors, (269), 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:10:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 345 transitions. [2024-11-07 10:10:42,227 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 345 transitions. Word has length 165 [2024-11-07 10:10:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:42,228 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 345 transitions. [2024-11-07 10:10:42,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.6) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 345 transitions. [2024-11-07 10:10:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:10:42,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:42,230 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:10:42,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -745444780, now seen corresponding path program 1 times [2024-11-07 10:10:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810241763] [2024-11-07 10:10:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:42,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810241763] [2024-11-07 10:10:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810241763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:42,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:10:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423628211] [2024-11-07 10:10:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:42,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:10:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:10:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:42,919 INFO L87 Difference]: Start difference. First operand 240 states and 345 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:43,437 INFO L93 Difference]: Finished difference Result 544 states and 783 transitions. [2024-11-07 10:10:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:10:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-07 10:10:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:43,440 INFO L225 Difference]: With dead ends: 544 [2024-11-07 10:10:43,440 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 10:10:43,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:10:43,441 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 142 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:43,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1944 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:10:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 10:10:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 240. [2024-11-07 10:10:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 198 states have internal predecessors, (268), 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:10:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2024-11-07 10:10:43,474 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 165 [2024-11-07 10:10:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2024-11-07 10:10:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:10:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2024-11-07 10:10:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:10:43,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:43,477 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:10:43,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -464003610, now seen corresponding path program 1 times [2024-11-07 10:10:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171700346] [2024-11-07 10:10:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171700346] [2024-11-07 10:10:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171700346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:10:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097216049] [2024-11-07 10:10:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:10:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:10:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:10:43,655 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:10:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:43,695 INFO L93 Difference]: Finished difference Result 483 states and 693 transitions. [2024-11-07 10:10:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:10:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-07 10:10:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:43,698 INFO L225 Difference]: With dead ends: 483 [2024-11-07 10:10:43,698 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 10:10:43,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:10:43,699 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:43,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 10:10:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-07 10:10:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 204 states have internal predecessors, (274), 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:10:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 350 transitions. [2024-11-07 10:10:43,725 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 350 transitions. Word has length 167 [2024-11-07 10:10:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:43,725 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 350 transitions. [2024-11-07 10:10:43,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:10:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 350 transitions. [2024-11-07 10:10:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:10:43,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:43,726 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:10:43,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:43,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1317282817, now seen corresponding path program 1 times [2024-11-07 10:10:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347718179] [2024-11-07 10:10:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347718179] [2024-11-07 10:10:44,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347718179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:44,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:10:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976029613] [2024-11-07 10:10:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:10:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:10:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:10:44,561 INFO L87 Difference]: Start difference. First operand 246 states and 350 transitions. Second operand has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:45,370 INFO L93 Difference]: Finished difference Result 681 states and 967 transitions. [2024-11-07 10:10:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:10:45,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2024-11-07 10:10:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:45,373 INFO L225 Difference]: With dead ends: 681 [2024-11-07 10:10:45,373 INFO L226 Difference]: Without dead ends: 438 [2024-11-07 10:10:45,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:10:45,374 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 398 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:45,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1380 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:10:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-07 10:10:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 270. [2024-11-07 10:10:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 228 states have internal predecessors, (307), 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:10:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 383 transitions. [2024-11-07 10:10:45,399 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 383 transitions. Word has length 169 [2024-11-07 10:10:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:45,399 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 383 transitions. [2024-11-07 10:10:45,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.0) internal successors, (72), 13 states have internal predecessors, (72), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:10:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 383 transitions. [2024-11-07 10:10:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:10:45,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:45,401 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:10:45,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 924255807, now seen corresponding path program 1 times [2024-11-07 10:10:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:45,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726703931] [2024-11-07 10:10:45,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:45,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:46,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:46,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726703931] [2024-11-07 10:10:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726703931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:46,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:46,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:10:46,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217261591] [2024-11-07 10:10:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:46,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:10:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:46,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:10:46,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:10:46,383 INFO L87 Difference]: Start difference. First operand 270 states and 383 transitions. Second operand has 12 states, 8 states have (on average 9.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 10:10:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:47,060 INFO L93 Difference]: Finished difference Result 612 states and 868 transitions. [2024-11-07 10:10:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:10:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 9.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) Word has length 169 [2024-11-07 10:10:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:47,062 INFO L225 Difference]: With dead ends: 612 [2024-11-07 10:10:47,062 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 10:10:47,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:10:47,063 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 266 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:47,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1752 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:10:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 10:10:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2024-11-07 10:10:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 285 states have (on average 1.3578947368421053) internal successors, (387), 287 states have internal predecessors, (387), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:10:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 483 transitions. [2024-11-07 10:10:47,096 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 483 transitions. Word has length 169 [2024-11-07 10:10:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:47,096 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 483 transitions. [2024-11-07 10:10:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 9.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 10:10:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 483 transitions. [2024-11-07 10:10:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:10:47,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:47,100 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:47,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:10:47,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 144835179, now seen corresponding path program 1 times [2024-11-07 10:10:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201444762] [2024-11-07 10:10:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:10:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201444762] [2024-11-07 10:10:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201444762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:10:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33203507] [2024-11-07 10:10:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:47,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:10:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:47,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:10:47,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:10:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:10:47,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:47,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-11-07 10:10:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-07 10:10:47,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:10:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:10:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33203507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:10:48,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:10:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-07 10:10:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006020775] [2024-11-07 10:10:48,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:10:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:10:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:10:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:10:48,243 INFO L87 Difference]: Start difference. First operand 339 states and 483 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:10:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:48,849 INFO L93 Difference]: Finished difference Result 1063 states and 1489 transitions. [2024-11-07 10:10:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 10:10:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 169 [2024-11-07 10:10:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:48,855 INFO L225 Difference]: With dead ends: 1063 [2024-11-07 10:10:48,855 INFO L226 Difference]: Without dead ends: 727 [2024-11-07 10:10:48,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:10:48,857 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 458 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:48,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1738 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:10:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-07 10:10:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 357. [2024-11-07 10:10:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 300 states have (on average 1.34) internal successors, (402), 302 states have internal predecessors, (402), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:10:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 498 transitions. [2024-11-07 10:10:48,902 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 498 transitions. Word has length 169 [2024-11-07 10:10:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:48,902 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 498 transitions. [2024-11-07 10:10:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 15 states have internal predecessors, (88), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:10:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 498 transitions. [2024-11-07 10:10:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:10:48,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:48,904 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:48,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:10:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 10:10:49,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 567537005, now seen corresponding path program 1 times [2024-11-07 10:10:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829885181] [2024-11-07 10:10:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:10:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 10:10:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:10:49,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:49,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829885181] [2024-11-07 10:10:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829885181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:49,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:49,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:10:49,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041305333] [2024-11-07 10:10:49,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:49,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:10:49,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:49,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:10:49,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:10:49,171 INFO L87 Difference]: Start difference. First operand 357 states and 498 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:10:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:49,209 INFO L93 Difference]: Finished difference Result 714 states and 999 transitions. [2024-11-07 10:10:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:10:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-07 10:10:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:49,211 INFO L225 Difference]: With dead ends: 714 [2024-11-07 10:10:49,211 INFO L226 Difference]: Without dead ends: 360 [2024-11-07 10:10:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:10:49,212 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:49,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-07 10:10:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-07 10:10:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 303 states have (on average 1.3366336633663367) internal successors, (405), 305 states have internal predecessors, (405), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:10:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 501 transitions. [2024-11-07 10:10:49,245 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 501 transitions. Word has length 169 [2024-11-07 10:10:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:49,246 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 501 transitions. [2024-11-07 10:10:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:10:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 501 transitions. [2024-11-07 10:10:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:10:49,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:49,247 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:10:49,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 786391723, now seen corresponding path program 1 times [2024-11-07 10:10:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412847353] [2024-11-07 10:10:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:10:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815683861] [2024-11-07 10:10:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:10:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:49,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:10:49,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 10:10:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:49,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:10:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:49,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:10:49,896 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:10:49,897 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:10:49,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:10:50,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:10:50,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:10:50,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:10:50,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:50 BoogieIcfgContainer [2024-11-07 10:10:50,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:10:50,172 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:10:50,172 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:10:50,173 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:10:50,173 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:29" (3/4) ... [2024-11-07 10:10:50,175 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:10:50,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:10:50,176 INFO L158 Benchmark]: Toolchain (without parser) took 21974.89ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 91.7MB in the beginning and 470.0MB in the end (delta: -378.3MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2024-11-07 10:10:50,176 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:50,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.98ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 75.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:10:50,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.14ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 71.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:50,176 INFO L158 Benchmark]: Boogie Preprocessor took 63.24ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 67.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:50,176 INFO L158 Benchmark]: RCFGBuilder took 546.61ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 78.6MB in the end (delta: -11.6MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-07 10:10:50,177 INFO L158 Benchmark]: TraceAbstraction took 21047.72ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 78.2MB in the beginning and 470.2MB in the end (delta: -392.0MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-07 10:10:50,177 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 587.2MB. Free memory was 470.2MB in the beginning and 470.0MB in the end (delta: 153.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:10:50,178 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.14ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.98ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 75.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.14ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 71.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.24ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 67.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 546.61ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 78.6MB in the end (delta: -11.6MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21047.72ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 78.2MB in the beginning and 470.2MB in the end (delta: -392.0MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 587.2MB. Free memory was 470.2MB in the beginning and 470.0MB in the end (delta: 153.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {0, 0} }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L25-L27] float float_Array_0[5] = { 1.75, 9.75, 1.4, 999.7, 1.2 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; [L28-L30] unsigned long int unsigned_long_int_Array_0[2][2][2] = { {{1394088949, 25}, {16, 16}}, {{0, 64}, {1277342739, 0}} }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L54] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L55] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L55] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L56] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L57] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L58] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L58] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L59] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L60] float_Array_0[0] = __VERIFIER_nondet_float() [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L61] EXPR float_Array_0[0] [L61] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L61] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L62] float_Array_0[1] = __VERIFIER_nondet_float() [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L63] EXPR float_Array_0[1] [L63] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L64] float_Array_0[2] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L65] EXPR float_Array_0[2] [L65] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L65] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L66] float_Array_0[3] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F [L67] EXPR float_Array_0[3] [L67] EXPR float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] EXPR (float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[3] >= -922337.2036854776000e+13F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854776000e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] EXPR float_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] CALL assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L68] RET assume_abort_if_not(float_Array_0[3] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L69] float_Array_0[4] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F [L70] EXPR float_Array_0[4] [L70] EXPR float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] EXPR (float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] CALL assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L70] RET assume_abort_if_not((float_Array_0[4] >= -922337.2036854776000e+13F && float_Array_0[4] <= -1.0e-20F) || (float_Array_0[4] <= 9223372.036854776000e+12F && float_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L71] unsigned_long_int_Array_0[0][0][0] = __VERIFIER_nondet_ulong() [L72] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] EXPR unsigned_long_int_Array_0[0][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L74] unsigned_long_int_Array_0[1][0][0] = __VERIFIER_nondet_ulong() [L75] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L76] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L77] unsigned_long_int_Array_0[1][1][0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] EXPR unsigned_long_int_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L80] unsigned_long_int_Array_0[1][0][1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L83] unsigned_long_int_Array_0[0][1][1] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] EXPR unsigned_long_int_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0][1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L98] RET updateVariables() [L99] CALL step() [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L34] EXPR unsigned_long_int_Array_0[0][1][1] [L34] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L34] unsigned_long_int_Array_0[1][1][1] = ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))) [L35] EXPR float_Array_0[4] [L35] EXPR float_Array_0[3] [L35] EXPR float_Array_0[2] [L35] EXPR float_Array_0[1] [L35] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L35] COND FALSE !((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR unsigned_long_int_Array_0[1][1][0] [L38] EXPR unsigned_long_int_Array_0[0][0][0] [L38] EXPR unsigned_long_int_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) [L38] EXPR unsigned_long_int_Array_0[0][1][1] [L38] EXPR ((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L38] unsigned_long_int_Array_0[0][1][0] = ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))) [L39] EXPR float_Array_0[4] [L39] unsigned char stepLocal_0 = (- float_Array_0[4]) != 1.9f; [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) [L40] EXPR unsigned_long_int_Array_0[0][0][1] [L40] EXPR unsigned_long_int_Array_0[1][0][0] [L40] EXPR unsigned_long_int_Array_0[1][0][1] [L40] stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L40] COND FALSE !(stepLocal_0 || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) [L43] EXPR BOOL_unsigned_char_Array_0[1][1] [L43] BOOL_unsigned_char_Array_0[0][1] = BOOL_unsigned_char_Array_0[1][1] [L45] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR unsigned_long_int_Array_0[1][1][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) [L90] EXPR float_Array_0[4] [L90] EXPR float_Array_0[3] [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 [L90] EXPR unsigned_long_int_Array_0[0][0][1] [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR unsigned_long_int_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) [L90] EXPR unsigned_long_int_Array_0[0][1][1] [L90] EXPR ((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR (((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90] EXPR ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L90-L91] return ((((unsigned_long_int_Array_0[1][1][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) && (((float_Array_0[4] / float_Array_0[3]) <= (float_Array_0[2] + (float_Array_0[1] - float_Array_0[0]))) ? (unsigned_long_int_Array_0[0][0][1] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) < (unsigned_long_int_Array_0[1][0][1])) ? (unsigned_long_int_Array_0[0][1][1]) : (unsigned_long_int_Array_0[1][0][1]))))) : 1)) && (unsigned_long_int_Array_0[0][1][0] == ((unsigned long int) ((((unsigned_long_int_Array_0[0][1][1]) > (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))) ? (unsigned_long_int_Array_0[0][1][1]) : (((unsigned_long_int_Array_0[1][1][0] + unsigned_long_int_Array_0[0][0][0]) - unsigned_long_int_Array_0[1][0][0]))))))) && (BOOL_unsigned_char_Array_0[0][1] ? ((! ((float_Array_0[4] / float_Array_0[3]) < (float_Array_0[1] - float_Array_0[0]))) ? (BOOL_unsigned_char_Array_0[0][1] ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][0]))) : 1) : 1) : 1)) && ((((- float_Array_0[4]) != 1.9f) || ((unsigned_long_int_Array_0[0][0][1] * unsigned_long_int_Array_0[1][0][0]) < unsigned_long_int_Array_0[1][0][1])) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2463 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2410 mSDsluCounter, 14110 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11527 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4695 IncrementalHoareTripleChecker+Invalid, 4993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 2583 mSDtfsCounter, 4695 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1004 GetRequests, 891 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=12, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 893 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2322 ConstructedInterpolants, 0 QuantifiedInterpolants, 8988 SizeOfPredicates, 4 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 10496/10640 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:10:50,248 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-23.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 a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:51,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:52,013 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:10:52,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:52,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:52,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:52,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:52,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:52,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:52,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:52,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:52,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:52,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:52,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:52,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:52,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:52,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:52,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:52,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:52,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:52,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:52,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:52,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:52,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:52,049 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 -> a2911b8889dd63413414f522ab20bad4acbdc28dfebaab4294bb46a3c6eab490 [2024-11-07 10:10:52,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:52,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:52,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:52,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:52,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:52,299 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-23.i [2024-11-07 10:10:53,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:53,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:53,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-23.i [2024-11-07 10:10:53,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9184791cd/d6eb949f15e14024b0018791522aef2c/FLAG03a7b63cc [2024-11-07 10:10:53,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9184791cd/d6eb949f15e14024b0018791522aef2c [2024-11-07 10:10:53,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:53,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:53,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:53,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:53,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:53,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:53" (1/1) ... [2024-11-07 10:10:53,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4987f612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:53, skipping insertion in model container [2024-11-07 10:10:53,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:53" (1/1) ... [2024-11-07 10:10:53,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:54,083 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-23.i[916,929] [2024-11-07 10:10:54,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:54,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:54,147 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-23.i[916,929] [2024-11-07 10:10:54,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:54,209 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:54,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54 WrapperNode [2024-11-07 10:10:54,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:54,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:54,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:54,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:54,217 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:10:54" (1/1) ... [2024-11-07 10:10:54,232 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:10:54" (1/1) ... [2024-11-07 10:10:54,268 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2024-11-07 10:10:54,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:54,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:54,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:54,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:54,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,309 INFO L175 MemorySlicer]: Split 146 memory accesses to 4 slices as follows [2, 26, 51, 67]. 46 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 8]. The 18 writes are split as follows [0, 5, 5, 8]. [2024-11-07 10:10:54,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:54,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:54,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:54,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:54,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (1/1) ... [2024-11-07 10:10:54,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:54,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:54,371 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:10:54,376 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:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:10:54,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:54,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:54,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:10:54,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:10:54,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:54,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:11:05,956 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-07 10:11:05,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:11:05,965 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:11:05,966 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:11:05,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:05 BoogieIcfgContainer [2024-11-07 10:11:05,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:11:05,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:11:05,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:11:05,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:11:05,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:53" (1/3) ... [2024-11-07 10:11:05,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797a74e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:05, skipping insertion in model container [2024-11-07 10:11:05,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:54" (2/3) ... [2024-11-07 10:11:05,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@797a74e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:05, skipping insertion in model container [2024-11-07 10:11:05,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:05" (3/3) ... [2024-11-07 10:11:05,976 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-23.i [2024-11-07 10:11:05,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:11:05,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:11:06,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:11:06,035 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;@5cc8695a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:11:06,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:11:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:11:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:11:06,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:06,049 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:06,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1186593926, now seen corresponding path program 1 times [2024-11-07 10:11:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105343047] [2024-11-07 10:11:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:06,060 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:11:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:06,062 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:11:06,063 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:11:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:06,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:11:06,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-07 10:11:06,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:06,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105343047] [2024-11-07 10:11:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105343047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:11:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595201443] [2024-11-07 10:11:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:11:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:11:06,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:06,576 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:06,595 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-07 10:11:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:11:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:11:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:06,600 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:11:06,600 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:11:06,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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:11:06,604 INFO L432 NwaCegarLoop]: 176 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, 176 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:11:06,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:11:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:11:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:11:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:11:06,638 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-07 10:11:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:11:06,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:11:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:11:06,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:06,644 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:06,658 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:11:06,844 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:11:06,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:06,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1867100974, now seen corresponding path program 1 times [2024-11-07 10:11:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298157412] [2024-11-07 10:11:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:06,846 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:11:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:06,848 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:11:06,849 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:11:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:07,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:11:07,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-07 10:11:07,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:07,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298157412] [2024-11-07 10:11:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298157412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:11:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102494163] [2024-11-07 10:11:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:11:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:07,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:11:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:11:07,342 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:07,411 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-07 10:11:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:11:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:07,416 INFO L225 Difference]: With dead ends: 239 [2024-11-07 10:11:07,416 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:11:07,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 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:11:07,419 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 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:11:07,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:11:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:11:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:11:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-07 10:11:07,432 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-07 10:11:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:07,435 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-07 10:11:07,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-07 10:11:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:11:07,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:07,439 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:07,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:07,639 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:11:07,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -24625260, now seen corresponding path program 1 times [2024-11-07 10:11:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864717285] [2024-11-07 10:11:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:07,642 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:11:07,643 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:11:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:08,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:11:08,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:08,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-11-07 10:11:08,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:08,818 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 32 treesize of output 14 [2024-11-07 10:11:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-07 10:11:08,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 10:11:09,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864717285] [2024-11-07 10:11:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864717285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:11:09,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:11:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-07 10:11:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776133648] [2024-11-07 10:11:09,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:11:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:11:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:11:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:11:09,477 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:11:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:12,822 INFO L93 Difference]: Finished difference Result 380 states and 545 transitions. [2024-11-07 10:11:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 10:11:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) Word has length 165 [2024-11-07 10:11:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:12,824 INFO L225 Difference]: With dead ends: 380 [2024-11-07 10:11:12,824 INFO L226 Difference]: Without dead ends: 261 [2024-11-07 10:11:12,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:11:12,826 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 229 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:12,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1829 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 10:11:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-07 10:11:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2024-11-07 10:11:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 194 states have internal predecessors, (262), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:11:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 342 transitions. [2024-11-07 10:11:12,860 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 342 transitions. Word has length 165 [2024-11-07 10:11:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 342 transitions. [2024-11-07 10:11:12,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (37), 2 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:11:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 342 transitions. [2024-11-07 10:11:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:11:12,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:12,862 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:12,877 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:11:13,062 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:11:13,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1612973162, now seen corresponding path program 1 times [2024-11-07 10:11:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964118809] [2024-11-07 10:11:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:13,064 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:11:13,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:13,066 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:11:13,067 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:11:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:13,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:11:13,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:11:13,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:13,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964118809] [2024-11-07 10:11:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964118809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731464023] [2024-11-07 10:11:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:13,462 INFO L87 Difference]: Start difference. First operand 239 states and 342 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:13,502 INFO L93 Difference]: Finished difference Result 476 states and 683 transitions. [2024-11-07 10:11:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 165 [2024-11-07 10:11:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:13,505 INFO L225 Difference]: With dead ends: 476 [2024-11-07 10:11:13,505 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 10:11:13,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:13,506 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:13,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 10:11:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-07 10:11:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3556701030927836) internal successors, (263), 195 states have internal predecessors, (263), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:11:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 343 transitions. [2024-11-07 10:11:13,527 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 343 transitions. Word has length 165 [2024-11-07 10:11:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:13,527 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 343 transitions. [2024-11-07 10:11:13,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 343 transitions. [2024-11-07 10:11:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 10:11:13,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:13,529 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:13,544 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:11:13,729 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:11:13,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:13,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash 687849428, now seen corresponding path program 1 times [2024-11-07 10:11:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636032388] [2024-11-07 10:11:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:13,731 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:11:13,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:13,732 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:11:13,734 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:11:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:14,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:14,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:14,235 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 77 treesize of output 41 [2024-11-07 10:11:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2024-11-07 10:11:14,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:14,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636032388] [2024-11-07 10:11:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636032388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268930582] [2024-11-07 10:11:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:14,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:14,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:14,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:14,274 INFO L87 Difference]: Start difference. First operand 240 states and 343 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:15,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:18,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:19,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:21,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:22,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:24,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:25,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:25,174 INFO L93 Difference]: Finished difference Result 479 states and 685 transitions. [2024-11-07 10:11:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:25,194 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-07 10:11:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:25,196 INFO L225 Difference]: With dead ends: 479 [2024-11-07 10:11:25,196 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 10:11:25,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:25,199 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 156 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:25,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 522 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-07 10:11:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 10:11:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-11-07 10:11:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 195 states have internal predecessors, (261), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:11:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 341 transitions. [2024-11-07 10:11:25,223 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 341 transitions. Word has length 165 [2024-11-07 10:11:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:25,223 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 341 transitions. [2024-11-07 10:11:25,223 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 341 transitions. [2024-11-07 10:11:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:11:25,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:25,225 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:25,243 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:11:25,425 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:11:25,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1338205264, now seen corresponding path program 1 times [2024-11-07 10:11:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083060007] [2024-11-07 10:11:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:25,426 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:11:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:25,428 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:11:25,429 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:11:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:25,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:11:25,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-07 10:11:25,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:25,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:25,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083060007] [2024-11-07 10:11:25,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083060007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:25,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:25,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:11:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277390581] [2024-11-07 10:11:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:25,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:25,866 INFO L87 Difference]: Start difference. First operand 240 states and 341 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:11:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:26,097 INFO L93 Difference]: Finished difference Result 489 states and 693 transitions. [2024-11-07 10:11:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-07 10:11:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:26,099 INFO L225 Difference]: With dead ends: 489 [2024-11-07 10:11:26,099 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 10:11:26,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 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:11:26,111 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:26,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 711 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:11:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 10:11:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2024-11-07 10:11:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.3350515463917525) internal successors, (259), 195 states have internal predecessors, (259), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:11:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 339 transitions. [2024-11-07 10:11:26,129 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 339 transitions. Word has length 167 [2024-11-07 10:11:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:26,129 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 339 transitions. [2024-11-07 10:11:26,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 10:11:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 339 transitions. [2024-11-07 10:11:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 10:11:26,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:26,131 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:26,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:11:26,332 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:11:26,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:26,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash -60748338, now seen corresponding path program 1 times [2024-11-07 10:11:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237548481] [2024-11-07 10:11:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:26,333 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:11:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:26,334 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:11:26,335 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:11:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:26,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:26,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:26,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:11:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-07 10:11:26,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:26,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237548481] [2024-11-07 10:11:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237548481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774011395] [2024-11-07 10:11:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:26,938 INFO L87 Difference]: Start difference. First operand 240 states and 339 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:29,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:31,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:32,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:34,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:36,430 INFO L93 Difference]: Finished difference Result 479 states and 677 transitions. [2024-11-07 10:11:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2024-11-07 10:11:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:36,455 INFO L225 Difference]: With dead ends: 479 [2024-11-07 10:11:36,455 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 10:11:36,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:36,456 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 146 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:36,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 516 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-07 10:11:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 10:11:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-11-07 10:11:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.324742268041237) internal successors, (257), 195 states have internal predecessors, (257), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:11:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 337 transitions. [2024-11-07 10:11:36,471 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 337 transitions. Word has length 167 [2024-11-07 10:11:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 337 transitions. [2024-11-07 10:11:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 10:11:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 337 transitions. [2024-11-07 10:11:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:11:36,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:36,473 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,494 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:11:36,673 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:11:36,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:36,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash 432201876, now seen corresponding path program 1 times [2024-11-07 10:11:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55943032] [2024-11-07 10:11:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:36,674 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:11:36,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:36,676 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:11:36,677 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:11:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:37,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:11:37,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:37,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:11:37,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-07 10:11:37,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:37,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2024-11-07 10:11:37,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:37,286 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 34 treesize of output 10 [2024-11-07 10:11:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:11:37,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:37,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55943032] [2024-11-07 10:11:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55943032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:37,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:37,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:11:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895548722] [2024-11-07 10:11:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:37,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:11:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:11:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:11:37,320 INFO L87 Difference]: Start difference. First operand 240 states and 337 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:39,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:41,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:43,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:43,807 INFO L93 Difference]: Finished difference Result 709 states and 997 transitions. [2024-11-07 10:11:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:43,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-07 10:11:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:43,810 INFO L225 Difference]: With dead ends: 709 [2024-11-07 10:11:43,810 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 10:11:43,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:43,811 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 147 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:43,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1220 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-07 10:11:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 10:11:43,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 468. [2024-11-07 10:11:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 381 states have (on average 1.3280839895013123) internal successors, (506), 384 states have internal predecessors, (506), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 10:11:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 658 transitions. [2024-11-07 10:11:43,838 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 658 transitions. Word has length 169 [2024-11-07 10:11:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 658 transitions. [2024-11-07 10:11:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 658 transitions. [2024-11-07 10:11:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:11:43,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:43,840 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,856 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:11:44,040 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:11:44,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -154604138, now seen corresponding path program 1 times [2024-11-07 10:11:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:44,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560455984] [2024-11-07 10:11:44,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:44,042 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:11:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:44,044 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:11:44,045 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:11:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:44,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:11:44,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:44,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:11:44,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:44,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2024-11-07 10:11:44,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:44,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2024-11-07 10:11:44,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:44,774 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 34 treesize of output 10 [2024-11-07 10:11:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:11:44,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:44,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560455984] [2024-11-07 10:11:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560455984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623707207] [2024-11-07 10:11:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:11:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:11:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:44,789 INFO L87 Difference]: Start difference. First operand 468 states and 658 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:46,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:47,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.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:11:50,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:50,455 INFO L93 Difference]: Finished difference Result 1008 states and 1409 transitions. [2024-11-07 10:11:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:11:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-07 10:11:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:50,459 INFO L225 Difference]: With dead ends: 1008 [2024-11-07 10:11:50,459 INFO L226 Difference]: Without dead ends: 543 [2024-11-07 10:11:50,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:50,460 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 141 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:50,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 621 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-07 10:11:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-07 10:11:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2024-11-07 10:11:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 433 states have (on average 1.3071593533487298) internal successors, (566), 437 states have internal predecessors, (566), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-07 10:11:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 750 transitions. [2024-11-07 10:11:50,490 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 750 transitions. Word has length 169 [2024-11-07 10:11:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:50,491 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 750 transitions. [2024-11-07 10:11:50,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 750 transitions. [2024-11-07 10:11:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:11:50,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:50,494 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:50,508 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:11:50,694 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:11:50,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 298188370, now seen corresponding path program 1 times [2024-11-07 10:11:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680515379] [2024-11-07 10:11:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:50,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:11:50,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:50,697 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:11:50,699 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:11:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:51,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:11:51,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:11:51,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:51,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 10:11:51,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:51,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-07 10:11:51,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:51,325 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 35 treesize of output 11 [2024-11-07 10:11:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:11:51,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:51,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680515379] [2024-11-07 10:11:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680515379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:51,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099508544] [2024-11-07 10:11:51,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:51,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:11:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:51,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:11:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:51,346 INFO L87 Difference]: Start difference. First operand 540 states and 750 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:52,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:55,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:55,527 INFO L93 Difference]: Finished difference Result 1020 states and 1411 transitions. [2024-11-07 10:11:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:11:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-07 10:11:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:55,531 INFO L225 Difference]: With dead ends: 1020 [2024-11-07 10:11:55,531 INFO L226 Difference]: Without dead ends: 551 [2024-11-07 10:11:55,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:55,534 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 140 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:55,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 870 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 10:11:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-07 10:11:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 460. [2024-11-07 10:11:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 380 states have internal predecessors, (496), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 10:11:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 636 transitions. [2024-11-07 10:11:55,559 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 636 transitions. Word has length 169 [2024-11-07 10:11:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 636 transitions. [2024-11-07 10:11:55,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 10:11:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 636 transitions. [2024-11-07 10:11:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 10:11:55,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:55,561 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,577 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:11:55,761 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:11:55,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:55,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -288617644, now seen corresponding path program 1 times [2024-11-07 10:11:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159998844] [2024-11-07 10:11:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:55,762 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:11:55,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:55,764 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:11:55,765 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:11:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:56,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:11:56,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:56,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:11:56,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-07 10:11:56,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2024-11-07 10:11:56,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:56,399 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 34 treesize of output 10 [2024-11-07 10:11:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 10:11:56,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:56,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159998844] [2024-11-07 10:11:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159998844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:56,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:56,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:11:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390853835] [2024-11-07 10:11:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:56,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:11:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:11:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:11:56,424 INFO L87 Difference]: Start difference. First operand 460 states and 636 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)