./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.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-sp_file-67.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', '2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb'] 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-sp_file-67.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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:58:52,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:58:52,333 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:58:52,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:58:52,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:58:52,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:58:52,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:58:52,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:58:52,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:58:52,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:58:52,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:58:52,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:58:52,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:58:52,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:58:52,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:58:52,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:58:52,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:58:52,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:58:52,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:58:52,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:58:52,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:58:52,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:58:52,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:58:52,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:58:52,367 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-11-07 10:58:52,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:58:52,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:58:52,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:58:52,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:58:52,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:58:52,656 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-sp_file-67.i [2024-11-07 10:58:53,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:58:54,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:58:54,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-07 10:58:54,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5936a987a/3cbde4aed4fa41f2896eb62becba987f/FLAG487505e44 [2024-11-07 10:58:54,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5936a987a/3cbde4aed4fa41f2896eb62becba987f [2024-11-07 10:58:54,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:58:54,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:58:54,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:58:54,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:58:54,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:58:54,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587ceec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54, skipping insertion in model container [2024-11-07 10:58:54,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:58:54,424 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-sp_file-67.i[917,930] [2024-11-07 10:58:54,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:58:54,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:58:54,515 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-sp_file-67.i[917,930] [2024-11-07 10:58:54,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:58:54,564 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:58:54,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54 WrapperNode [2024-11-07 10:58:54,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:58:54,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:58:54,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:58:54,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:58:54,571 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:58:54" (1/1) ... [2024-11-07 10:58:54,585 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:58:54" (1/1) ... [2024-11-07 10:58:54,634 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-07 10:58:54,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:58:54,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:58:54,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:58:54,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:58:54,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,669 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:58:54,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:58:54,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:58:54,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:58:54,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:58:54,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (1/1) ... [2024-11-07 10:58:54,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:58:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:58:54,752 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:58:54,755 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:58:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:58:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:58:54,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:58:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:58:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:58:54,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:58:54,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:58:54,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:58:55,376 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 10:58:55,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:58:55,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:58:55,387 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:58:55,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:58:55 BoogieIcfgContainer [2024-11-07 10:58:55,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:58:55,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:58:55,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:58:55,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:58:55,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:58:54" (1/3) ... [2024-11-07 10:58:55,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc55273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:58:55, skipping insertion in model container [2024-11-07 10:58:55,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:58:54" (2/3) ... [2024-11-07 10:58:55,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc55273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:58:55, skipping insertion in model container [2024-11-07 10:58:55,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:58:55" (3/3) ... [2024-11-07 10:58:55,396 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-07 10:58:55,409 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:58:55,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:58:55,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:58:55,476 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;@7bfbf3ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:58:55,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:58:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:58:55,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:55,490 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:55,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 742144131, now seen corresponding path program 1 times [2024-11-07 10:58:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997978494] [2024-11-07 10:58:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:58:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:58:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:58:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997978494] [2024-11-07 10:58:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997978494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:58:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431748659] [2024-11-07 10:58:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:58:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:55,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:58:55,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:58:55,948 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:55,971 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-07 10:58:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:58:55,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-07 10:58:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:55,982 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:58:55,982 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:58:55,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:58:55,988 INFO L432 NwaCegarLoop]: 126 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, 126 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:58:55,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:58:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:58:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-07 10:58:56,032 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-07 10:58:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:56,032 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-07 10:58:56,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-07 10:58:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:58:56,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:56,036 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:56,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:58:56,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:56,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1977666007, now seen corresponding path program 1 times [2024-11-07 10:58:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115752077] [2024-11-07 10:58:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:58:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:58:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:58:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115752077] [2024-11-07 10:58:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115752077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:58:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618718794] [2024-11-07 10:58:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:58:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:58:56,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:58:56,450 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:56,496 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-11-07 10:58:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:58:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:58:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:56,499 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:58:56,499 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:58:56,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:58:56,500 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 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:58:56,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:58:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-07 10:58:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 10:58:56,510 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-07 10:58:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:56,511 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 10:58:56,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 10:58:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:58:56,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:56,513 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:56,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:58:56,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:56,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1637242919, now seen corresponding path program 1 times [2024-11-07 10:58:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:56,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273620261] [2024-11-07 10:58:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:58:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:58:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:58:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273620261] [2024-11-07 10:58:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273620261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:58:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688879190] [2024-11-07 10:58:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:58:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:58:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:58:56,797 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:56,842 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-07 10:58:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:58:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:58:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:56,847 INFO L225 Difference]: With dead ends: 182 [2024-11-07 10:58:56,847 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:58:56,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:58:56,848 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 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:58:56,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:58:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-07 10:58:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-07 10:58:56,865 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-07 10:58:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-07 10:58:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-07 10:58:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:58:56,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:56,870 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:56,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:58:56,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 137764443, now seen corresponding path program 1 times [2024-11-07 10:58:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904561014] [2024-11-07 10:58:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:58:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:58:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:58:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:58:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:58:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:58:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:58:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:58:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:58:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:58:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:58:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:58:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:58:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904561014] [2024-11-07 10:58:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904561014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:58:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971817300] [2024-11-07 10:58:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:58:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:58:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:58:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:58:57,123 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:57,165 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-07 10:58:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:58:57,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:58:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:57,168 INFO L225 Difference]: With dead ends: 186 [2024-11-07 10:58:57,168 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:58:57,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:58:57,172 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 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:58:57,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:58:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-07 10:58:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-07 10:58:57,185 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-07 10:58:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:57,185 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-07 10:58:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-07 10:58:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:58:57,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:57,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:57,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:58:57,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 139611485, now seen corresponding path program 1 times [2024-11-07 10:58:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:58:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115754275] [2024-11-07 10:58:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:58:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:59:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:59:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:59:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:59:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:59:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:59:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:59:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:59:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:59:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:08,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:59:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:59:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:59:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 10:59:08,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:59:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115754275] [2024-11-07 10:59:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115754275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:59:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972693199] [2024-11-07 10:59:08,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:59:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:59:08,118 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:59:08,119 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:59:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:08,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-07 10:59:08,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:08,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:59:10,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-07 10:59:12,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-07 10:59:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-07 10:59:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-07 10:59:14,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2024-11-07 10:59:15,525 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 193 treesize of output 139 [2024-11-07 10:59:15,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:15,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:15,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:15,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 139 [2024-11-07 10:59:15,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:15,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 55 [2024-11-07 10:59:16,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 104 [2024-11-07 10:59:16,886 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2024-11-07 10:59:16,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 171 [2024-11-07 10:59:16,927 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 53 treesize of output 37 [2024-11-07 10:59:17,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2024-11-07 10:59:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,141 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-07 10:59:17,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 210 [2024-11-07 10:59:17,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,451 INFO L349 Elim1Store]: treesize reduction 70, result has 20.5 percent of original size [2024-11-07 10:59:17,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 167 treesize of output 154 [2024-11-07 10:59:17,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2024-11-07 10:59:17,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:17,606 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-07 10:59:17,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 222 [2024-11-07 10:59:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2024-11-07 10:59:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,145 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-07 10:59:18,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 72 [2024-11-07 10:59:18,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2024-11-07 10:59:18,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2024-11-07 10:59:18,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,306 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-07 10:59:18,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 220 [2024-11-07 10:59:18,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2024-11-07 10:59:18,902 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-07 10:59:18,943 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-07 10:59:18,968 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-07 10:59:19,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,225 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 10:59:19,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 110 [2024-11-07 10:59:19,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:59:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 135 [2024-11-07 10:59:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 10:59:19,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:59:20,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_524 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)) v_ArrVal_524)) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse4 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse1 (mod (+ (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (< 32767 .cse1))))) (not (= v_ArrVal_525 (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))))) (forall ((v_ArrVal_524 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)) v_ArrVal_524)) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse9 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse9 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse6 (mod (+ (select (select .cse7 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse6 (+ 65536 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse6 32768))))) (not (= v_ArrVal_525 (store (select .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))))))) is different from false [2024-11-07 10:59:20,637 WARN L851 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| |c_ULTIMATE.start_step_#t~mem7#1|) (let ((.cse6 (select |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base))) (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_523)))) (or (not (= v_ArrVal_524 (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse5 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse4 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse1 (mod (+ (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (< 32767 .cse1) (= .cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))))) (not (= v_ArrVal_525 (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))))))))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 Int)) (let ((.cse7 (store |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_523)))) (or (not (= v_ArrVal_524 (store (select .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse12 (store .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse11 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse11 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse10 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse8 (mod (+ (select (select .cse9 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse8 (+ (select (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 65536)) (< .cse8 32768))))) (not (= v_ArrVal_525 (store (select .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))))))))))) (and (not (= |c_ULTIMATE.start_step_#t~mem8#1| 0)) (not (= |c_ULTIMATE.start_step_#t~mem7#1| 0)))) is different from false [2024-11-07 10:59:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972693199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:59:23,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:59:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2024-11-07 10:59:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733200391] [2024-11-07 10:59:23,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:59:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-07 10:59:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:59:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-07 10:59:23,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2297, Unknown=6, NotChecked=202, Total=2862 [2024-11-07 10:59:23,167 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-07 10:59:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:29,787 INFO L93 Difference]: Finished difference Result 373 states and 507 transitions. [2024-11-07 10:59:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 10:59:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) Word has length 104 [2024-11-07 10:59:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:29,790 INFO L225 Difference]: With dead ends: 373 [2024-11-07 10:59:29,790 INFO L226 Difference]: Without dead ends: 281 [2024-11-07 10:59:29,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=915, Invalid=4939, Unknown=6, NotChecked=302, Total=6162 [2024-11-07 10:59:29,794 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1160 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:29,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 2102 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 10:59:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-07 10:59:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 128. [2024-11-07 10:59:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 170 transitions. [2024-11-07 10:59:29,811 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 170 transitions. Word has length 104 [2024-11-07 10:59:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:29,812 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 170 transitions. [2024-11-07 10:59:29,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-07 10:59:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 170 transitions. [2024-11-07 10:59:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:59:29,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:29,814 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:29,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:59:30,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:59:30,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:30,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1665826849, now seen corresponding path program 1 times [2024-11-07 10:59:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:59:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097804105] [2024-11-07 10:59:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:59:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:59:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:59:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:59:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:59:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:59:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:59:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:59:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:59:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:59:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:59:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:59:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:59:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:59:30,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:59:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097804105] [2024-11-07 10:59:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097804105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:59:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:59:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:59:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810786439] [2024-11-07 10:59:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:59:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:59:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:59:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:59:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:30,123 INFO L87 Difference]: Start difference. First operand 128 states and 170 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:59:30,183 INFO L93 Difference]: Finished difference Result 307 states and 411 transitions. [2024-11-07 10:59:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:59:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:59:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:59:30,185 INFO L225 Difference]: With dead ends: 307 [2024-11-07 10:59:30,185 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 10:59:30,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:59:30,186 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:59:30,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:59:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 10:59:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-07 10:59:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:59:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-07 10:59:30,210 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 104 [2024-11-07 10:59:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:59:30,210 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-07 10:59:30,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:59:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-07 10:59:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:59:30,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:59:30,212 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:30,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:59:30,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:59:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:59:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash 58712133, now seen corresponding path program 1 times [2024-11-07 10:59:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:59:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608031947] [2024-11-07 10:59:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:59:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat