./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.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-s_file-72.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', '8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a'] 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-s_file-72.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 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:48:33,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:48:33,480 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:48:33,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:48:33,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:48:33,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:48:33,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:48:33,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:48:33,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:48:33,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:48:33,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:48:33,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:48:33,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:48:33,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:48:33,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:48:33,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:33,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:48:33,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:48:33,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:48:33,509 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 -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-11-07 10:48:33,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:48:33,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:48:33,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:48:33,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:48:33,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:48:33,913 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-s_file-72.i [2024-11-07 10:48:35,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:48:35,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:48:35,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-11-07 10:48:35,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c54fbe39/0275312cfe424cf9bc87879bf9b3fd96/FLAG038fdd654 [2024-11-07 10:48:35,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c54fbe39/0275312cfe424cf9bc87879bf9b3fd96 [2024-11-07 10:48:35,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:48:35,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:48:35,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:35,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:48:35,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:48:35,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71820b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35, skipping insertion in model container [2024-11-07 10:48:35,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:48:35,362 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-s_file-72.i[916,929] [2024-11-07 10:48:35,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:35,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:48:35,432 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-s_file-72.i[916,929] [2024-11-07 10:48:35,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:35,468 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:48:35,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35 WrapperNode [2024-11-07 10:48:35,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:35,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:35,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:48:35,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:48:35,475 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:48:35" (1/1) ... [2024-11-07 10:48:35,491 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:48:35" (1/1) ... [2024-11-07 10:48:35,533 INFO L138 Inliner]: procedures = 30, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536 [2024-11-07 10:48:35,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:35,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:48:35,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:48:35,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:48:35,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,558 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:48:35,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:48:35,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:48:35,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:48:35,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:48:35,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (1/1) ... [2024-11-07 10:48:35,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:35,636 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:48:35,640 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:48:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:48:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:48:35,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:48:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:48:35,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:48:35,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:48:35,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:48:36,258 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-11-07 10:48:36,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:48:36,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:48:36,268 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:48:36,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:36 BoogieIcfgContainer [2024-11-07 10:48:36,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:48:36,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:48:36,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:48:36,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:48:36,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:48:35" (1/3) ... [2024-11-07 10:48:36,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dc8730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:36, skipping insertion in model container [2024-11-07 10:48:36,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:35" (2/3) ... [2024-11-07 10:48:36,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dc8730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:48:36, skipping insertion in model container [2024-11-07 10:48:36,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:36" (3/3) ... [2024-11-07 10:48:36,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-11-07 10:48:36,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:48:36,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:48:36,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:48:36,333 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;@4ddbca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:48:36,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:48:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:48:36,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:36,349 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1260773947, now seen corresponding path program 1 times [2024-11-07 10:48:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:36,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212735704] [2024-11-07 10:48:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212735704] [2024-11-07 10:48:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212735704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:36,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575779035] [2024-11-07 10:48:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:37,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:37,021 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:48:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:37,076 INFO L93 Difference]: Finished difference Result 251 states and 388 transitions. [2024-11-07 10:48:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-11-07 10:48:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:37,084 INFO L225 Difference]: With dead ends: 251 [2024-11-07 10:48:37,084 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 10:48:37,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:48:37,088 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 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:48:37,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 10:48:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-07 10:48:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-07 10:48:37,120 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2024-11-07 10:48:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:37,121 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-07 10:48:37,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:48:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-07 10:48:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:48:37,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:37,124 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:48:37,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:37,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash 584593219, now seen corresponding path program 1 times [2024-11-07 10:48:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116328607] [2024-11-07 10:48:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116328607] [2024-11-07 10:48:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116328607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736710115] [2024-11-07 10:48:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:37,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:37,504 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:37,538 INFO L93 Difference]: Finished difference Result 251 states and 364 transitions. [2024-11-07 10:48:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2024-11-07 10:48:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:37,542 INFO L225 Difference]: With dead ends: 251 [2024-11-07 10:48:37,542 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 10:48:37,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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:48:37,543 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 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:48:37,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 10:48:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-07 10:48:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2024-11-07 10:48:37,554 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 149 [2024-11-07 10:48:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2024-11-07 10:48:37,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2024-11-07 10:48:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:37,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:37,559 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:48:37,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1340171006, now seen corresponding path program 1 times [2024-11-07 10:48:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:37,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137830399] [2024-11-07 10:48:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:37,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137830399] [2024-11-07 10:48:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137830399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:37,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047503068] [2024-11-07 10:48:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:37,766 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:37,792 INFO L93 Difference]: Finished difference Result 256 states and 369 transitions. [2024-11-07 10:48:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:37,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:48:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:37,797 INFO L225 Difference]: With dead ends: 256 [2024-11-07 10:48:37,797 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:48:37,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:48:37,798 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:37,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:48:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-07 10:48:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2024-11-07 10:48:37,804 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 151 [2024-11-07 10:48:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:37,804 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2024-11-07 10:48:37,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:37,804 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2024-11-07 10:48:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:37,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:37,806 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:48:37,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2020229376, now seen corresponding path program 1 times [2024-11-07 10:48:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762882313] [2024-11-07 10:48:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762882313] [2024-11-07 10:48:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762882313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325110823] [2024-11-07 10:48:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:37,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:37,988 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:38,008 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-11-07 10:48:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:48:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:38,009 INFO L225 Difference]: With dead ends: 260 [2024-11-07 10:48:38,009 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 10:48:38,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:48:38,011 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:38,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 10:48:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-07 10:48:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-07 10:48:38,022 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 151 [2024-11-07 10:48:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:38,022 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-07 10:48:38,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-07 10:48:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:38,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:38,027 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:48:38,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -499730558, now seen corresponding path program 1 times [2024-11-07 10:48:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194006429] [2024-11-07 10:48:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194006429] [2024-11-07 10:48:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194006429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:38,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:48:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881884729] [2024-11-07 10:48:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:48:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:48:38,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:48:38,179 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:38,198 INFO L93 Difference]: Finished difference Result 264 states and 377 transitions. [2024-11-07 10:48:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:48:38,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:48:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:38,200 INFO L225 Difference]: With dead ends: 264 [2024-11-07 10:48:38,200 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:48:38,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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:48:38,201 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:38,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:48:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:48:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:48:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-07 10:48:38,212 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 151 [2024-11-07 10:48:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:38,212 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-07 10:48:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-07 10:48:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:38,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:38,213 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:48:38,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash -497883516, now seen corresponding path program 1 times [2024-11-07 10:48:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300911428] [2024-11-07 10:48:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:48:38,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300911428] [2024-11-07 10:48:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300911428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:48:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:48:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:48:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372488873] [2024-11-07 10:48:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:48:38,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:48:38,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:48:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:48:38,834 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:39,093 INFO L93 Difference]: Finished difference Result 267 states and 380 transitions. [2024-11-07 10:48:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:48:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:48:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:39,096 INFO L225 Difference]: With dead ends: 267 [2024-11-07 10:48:39,096 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 10:48:39,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:48:39,097 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:39,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 404 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:48:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 10:48:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-07 10:48:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-07 10:48:39,114 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 151 [2024-11-07 10:48:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:39,114 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-07 10:48:39,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:48:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-07 10:48:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:39,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:39,116 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:39,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:48:39,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:39,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash 37707956, now seen corresponding path program 1 times [2024-11-07 10:48:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067232410] [2024-11-07 10:48:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:48:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:48:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:48:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:48:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:48:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:48:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:48:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:48:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:48:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:48:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:48:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:48:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:48:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:48:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:48:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:48:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:48:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:48:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:48:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067232410] [2024-11-07 10:48:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067232410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:48:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017170338] [2024-11-07 10:48:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:48:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:40,262 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:48:40,270 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:48:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:48:40,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:48:40,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:48:40,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:48:40,924 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 21 treesize of output 9 [2024-11-07 10:48:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 10:48:40,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:48:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:48:41,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017170338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:48:41,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:48:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-07 10:48:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886034906] [2024-11-07 10:48:41,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:48:41,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:48:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:48:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:48:41,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:48:41,276 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 14 states have internal predecessors, (115), 7 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (46), 4 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-07 10:48:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:48:41,896 INFO L93 Difference]: Finished difference Result 277 states and 388 transitions. [2024-11-07 10:48:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:48:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 14 states have internal predecessors, (115), 7 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (46), 4 states have call predecessors, (46), 7 states have call successors, (46) Word has length 151 [2024-11-07 10:48:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:48:41,898 INFO L225 Difference]: With dead ends: 277 [2024-11-07 10:48:41,898 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 10:48:41,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 327 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:48:41,899 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 358 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:48:41,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 447 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:48:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 10:48:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2024-11-07 10:48:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:48:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2024-11-07 10:48:41,907 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 151 [2024-11-07 10:48:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:48:41,907 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2024-11-07 10:48:41,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 14 states have internal predecessors, (115), 7 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (46), 4 states have call predecessors, (46), 7 states have call successors, (46) [2024-11-07 10:48:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2024-11-07 10:48:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:48:41,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:48:41,909 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:41,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:48:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:48:42,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:48:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:48:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 739307830, now seen corresponding path program 1 times [2024-11-07 10:48:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:48:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204287890] [2024-11-07 10:48:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:48:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:48:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:48:42,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:48:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:48:42,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:48:42,303 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:48:42,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:48:42,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:48:42,306 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:48:42,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:48:42,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:48:42 BoogieIcfgContainer [2024-11-07 10:48:42,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:48:42,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:48:42,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:48:42,372 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:48:42,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:48:36" (3/4) ... [2024-11-07 10:48:42,374 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:48:42,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:48:42,375 INFO L158 Benchmark]: Toolchain (without parser) took 7125.91ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 91.1MB in the beginning and 212.6MB in the end (delta: -121.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-07 10:48:42,375 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:42,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.30ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:48:42,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.60ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:42,376 INFO L158 Benchmark]: Boogie Preprocessor took 60.96ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 66.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:48:42,376 INFO L158 Benchmark]: RCFGBuilder took 672.15ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 78.1MB in the end (delta: -11.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-07 10:48:42,376 INFO L158 Benchmark]: TraceAbstraction took 6101.39ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 77.6MB in the beginning and 212.7MB in the end (delta: -135.1MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2024-11-07 10:48:42,376 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 268.4MB. Free memory was 212.7MB in the beginning and 212.6MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:48:42,377 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.76ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.30ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 73.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.60ms. Allocated memory is still 117.4MB. Free memory was 73.6MB in the beginning and 70.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.96ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 66.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 672.15ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 78.1MB in the end (delta: -11.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6101.39ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 77.6MB in the beginning and 212.7MB in the end (delta: -135.1MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 268.4MB. Free memory was 212.7MB in the beginning and 212.6MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L61] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L62] double last_1_WrapperStruct00_var_1_15 = 256.4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_1 [L114] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_15 [L115] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L85] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L100] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L103] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L106] WrapperStruct00.var_1_17 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR (WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L108] WrapperStruct00.var_1_18 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR (WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L110] WrapperStruct00.var_1_19 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR (WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L126] RET updateVariables() [L127] CALL step() [L66] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L66] COND FALSE !(WrapperStruct00.var_1_9) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] WrapperStruct00.var_1_11 = (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))) [L70] EXPR WrapperStruct00.var_1_19 [L70] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L71] WrapperStruct00.var_1_21 = 1 [L72] WrapperStruct00.var_1_22 = 10 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_16 [L73] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L73] COND FALSE !((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) [L80] EXPR WrapperStruct00.var_1_20 [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] COND FALSE !(WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_20 [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_6 [L118] EXPR WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118-L119] return (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 3461 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2384 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 1077 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 545 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1346 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 4 NumberOfNonLiveVariables, 560 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4797/4896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:48:42,399 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-s_file-72.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 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:48:44,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:48:44,200 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:48:44,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:48:44,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:48:44,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:48:44,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:48:44,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:48:44,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:48:44,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:48:44,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:48:44,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:48:44,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:48:44,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:48:44,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:44,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:48:44,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:48:44,232 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 -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-11-07 10:48:44,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:48:44,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:48:44,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:48:44,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:48:44,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:48:44,471 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-s_file-72.i [2024-11-07 10:48:45,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:48:45,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:48:45,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-11-07 10:48:45,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/495e82f1c/5589900ed09a45c6a568c00fb9c59f78/FLAGf5d37fbb3 [2024-11-07 10:48:46,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/495e82f1c/5589900ed09a45c6a568c00fb9c59f78 [2024-11-07 10:48:46,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:48:46,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:48:46,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:46,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:48:46,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:48:46,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3616db5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46, skipping insertion in model container [2024-11-07 10:48:46,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:48:46,343 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-s_file-72.i[916,929] [2024-11-07 10:48:46,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:46,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:48:46,405 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-s_file-72.i[916,929] [2024-11-07 10:48:46,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:48:46,463 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:48:46,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46 WrapperNode [2024-11-07 10:48:46,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:48:46,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:46,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:48:46,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:48:46,473 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:48:46" (1/1) ... [2024-11-07 10:48:46,488 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:48:46" (1/1) ... [2024-11-07 10:48:46,520 INFO L138 Inliner]: procedures = 40, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 532 [2024-11-07 10:48:46,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:48:46,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:48:46,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:48:46,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:48:46,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,555 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-07 10:48:46,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:48:46,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:48:46,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:48:46,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:48:46,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (1/1) ... [2024-11-07 10:48:46,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:48:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:48:46,660 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:48:46,664 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:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:48:46,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:48:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:48:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:48:46,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:48:46,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:48:46,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:48:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:48:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:48:46,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:48:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:48:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:48:46,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:48:46,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:48:46,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:48:46,826 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:48:46,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:49:19,640 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-07 10:49:19,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:49:19,651 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:49:19,651 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:49:19,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:49:19 BoogieIcfgContainer [2024-11-07 10:49:19,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:49:19,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:49:19,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:49:19,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:49:19,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:48:46" (1/3) ... [2024-11-07 10:49:19,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3249b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:49:19, skipping insertion in model container [2024-11-07 10:49:19,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:48:46" (2/3) ... [2024-11-07 10:49:19,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3249b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:49:19, skipping insertion in model container [2024-11-07 10:49:19,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:49:19" (3/3) ... [2024-11-07 10:49:19,661 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-11-07 10:49:19,681 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:49:19,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:49:19,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:49:19,721 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;@9f6d3c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:49:19,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:49:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:49:19,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:19,736 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:19,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2040100048, now seen corresponding path program 1 times [2024-11-07 10:49:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833779516] [2024-11-07 10:49:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:19,751 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:49:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:19,753 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:49:19,754 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:49:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:20,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:49:20,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-07 10:49:21,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:21,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833779516] [2024-11-07 10:49:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833779516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:21,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:49:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062124684] [2024-11-07 10:49:21,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:49:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:49:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:49:21,049 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 109 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:49:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:21,072 INFO L93 Difference]: Finished difference Result 249 states and 385 transitions. [2024-11-07 10:49:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:49:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-11-07 10:49:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:21,081 INFO L225 Difference]: With dead ends: 249 [2024-11-07 10:49:21,081 INFO L226 Difference]: Without dead ends: 124 [2024-11-07 10:49:21,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:49:21,086 INFO L432 NwaCegarLoop]: 180 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, 180 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:49:21,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:49:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-07 10:49:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-07 10:49:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2024-11-07 10:49:21,126 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 149 [2024-11-07 10:49:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:21,126 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2024-11-07 10:49:21,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:49:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2024-11-07 10:49:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:49:21,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:21,128 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:21,158 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:49:21,329 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:49:21,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -539010118, now seen corresponding path program 1 times [2024-11-07 10:49:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036961095] [2024-11-07 10:49:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:21,330 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:49:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:21,332 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:49:21,333 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:49:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:22,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:49:22,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:49:22,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:22,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036961095] [2024-11-07 10:49:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036961095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:49:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19237262] [2024-11-07 10:49:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:22,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:49:22,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:49:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:49:22,676 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:23,319 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2024-11-07 10:49:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:49:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2024-11-07 10:49:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:23,321 INFO L225 Difference]: With dead ends: 247 [2024-11-07 10:49:23,321 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 10:49:23,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:49:23,322 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 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.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:23,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:49:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 10:49:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-07 10:49:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-07 10:49:23,330 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2024-11-07 10:49:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:23,331 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-07 10:49:23,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-07 10:49:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:49:23,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:23,333 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:49:23,534 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:49:23,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 129747173, now seen corresponding path program 1 times [2024-11-07 10:49:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:23,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529977566] [2024-11-07 10:49:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:23,535 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:49:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:23,537 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:49:23,539 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:49:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:24,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:49:24,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:49:25,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:25,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529977566] [2024-11-07 10:49:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529977566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:25,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:25,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:49:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184512858] [2024-11-07 10:49:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:25,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:49:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:49:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:49:25,183 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:26,245 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2024-11-07 10:49:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:49:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:49:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:26,248 INFO L225 Difference]: With dead ends: 256 [2024-11-07 10:49:26,248 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 10:49:26,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:49:26,249 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:26,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 844 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:49:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 10:49:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-07 10:49:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-07 10:49:26,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 151 [2024-11-07 10:49:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:26,257 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-07 10:49:26,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-07 10:49:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:49:26,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:26,258 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:26,293 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:49:26,458 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:49:26,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:26,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 809805543, now seen corresponding path program 1 times [2024-11-07 10:49:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800693376] [2024-11-07 10:49:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:26,460 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:49:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:26,462 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:49:26,463 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:49:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:27,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:49:27,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:49:28,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:28,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800693376] [2024-11-07 10:49:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800693376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:49:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320960234] [2024-11-07 10:49:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:28,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:49:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:49:28,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:49:28,199 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:28,967 INFO L93 Difference]: Finished difference Result 264 states and 377 transitions. [2024-11-07 10:49:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:49:28,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:49:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:28,968 INFO L225 Difference]: With dead ends: 264 [2024-11-07 10:49:28,968 INFO L226 Difference]: Without dead ends: 135 [2024-11-07 10:49:28,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:49:28,969 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:28,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:49:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-07 10:49:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-07 10:49:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-07 10:49:28,987 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 151 [2024-11-07 10:49:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-07 10:49:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-07 10:49:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:49:28,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:28,989 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,016 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:49:29,189 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:49:29,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1710154391, now seen corresponding path program 1 times [2024-11-07 10:49:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:29,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837985944] [2024-11-07 10:49:29,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:29,190 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:49:29,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:29,192 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:49:29,193 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:49:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:30,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:49:30,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:49:31,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:31,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:31,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837985944] [2024-11-07 10:49:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837985944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:31,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:31,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:49:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616971219] [2024-11-07 10:49:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:49:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:49:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:49:31,070 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:49:32,133 INFO L93 Difference]: Finished difference Result 268 states and 381 transitions. [2024-11-07 10:49:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:49:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2024-11-07 10:49:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:49:32,134 INFO L225 Difference]: With dead ends: 268 [2024-11-07 10:49:32,135 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 10:49:32,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:49:32,136 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:49:32,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1160 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:49:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 10:49:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-07 10:49:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:49:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2024-11-07 10:49:32,147 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 151 [2024-11-07 10:49:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:49:32,147 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2024-11-07 10:49:32,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:49:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2024-11-07 10:49:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:49:32,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:49:32,149 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:32,182 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:49:32,349 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:49:32,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:49:32,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:49:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1708307349, now seen corresponding path program 1 times [2024-11-07 10:49:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:49:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286450386] [2024-11-07 10:49:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:49:32,350 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:49:32,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:49:32,352 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:49:32,353 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:49:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:49:33,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:49:33,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:49:35,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:49:35,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-07 10:49:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-07 10:49:36,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:49:36,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:49:36,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286450386] [2024-11-07 10:49:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286450386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:49:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:49:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:49:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133851974] [2024-11-07 10:49:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:49:36,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:49:36,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:49:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:49:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:49:36,133 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:49:43,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:49:47,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:49:51,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:49:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:49:59,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:50:03,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:50:07,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:50:12,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 10:50:14,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []