./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.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-92.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', '34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14'] 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-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:01:48,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:01:48,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:01:48,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:01:48,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:01:48,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:01:48,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:01:48,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:01:48,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:01:48,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:01:48,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:01:48,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:01:48,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:01:48,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:01:48,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:01:48,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:01:48,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:01:48,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:01:48,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:01:48,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:01:48,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:01:48,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:01:48,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:01:48,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:48,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:01:48,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:01:48,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:01:48,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:01:48,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:01:48,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:01:48,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:01:48,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:01:48,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:01:48,769 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2024-11-07 11:01:49,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:01:49,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:01:49,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:01:49,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:01:49,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:01:49,069 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-92.i [2024-11-07 11:01:50,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:01:50,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:01:50,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-07 11:01:50,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ea863696/ffcf7cec6fea4c5bae0485d83bf444c0/FLAG0796592f9 [2024-11-07 11:01:50,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ea863696/ffcf7cec6fea4c5bae0485d83bf444c0 [2024-11-07 11:01:50,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:01:50,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:01:50,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:50,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:01:50,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:01:50,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:50" (1/1) ... [2024-11-07 11:01:50,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304eeeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:50, skipping insertion in model container [2024-11-07 11:01:50,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:50" (1/1) ... [2024-11-07 11:01:50,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:01:51,006 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-92.i[917,930] [2024-11-07 11:01:51,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:51,071 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:01:51,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-11-07 11:01:51,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:51,147 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:01:51,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51 WrapperNode [2024-11-07 11:01:51,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:51,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:51,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:01:51,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:01:51,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,197 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-11-07 11:01:51,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:51,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:01:51,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:01:51,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:01:51,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,218 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 11:01:51,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:01:51,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:01:51,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:01:51,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:01:51,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (1/1) ... [2024-11-07 11:01:51,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:51,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:51,298 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 11:01:51,301 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 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 11:01:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 11:01:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 11:01:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:01:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:01:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 11:01:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:01:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:01:51,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:01:51,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:01:52,144 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-07 11:01:52,145 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:01:52,155 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:01:52,156 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:01:52,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:52 BoogieIcfgContainer [2024-11-07 11:01:52,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:01:52,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:01:52,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:01:52,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:01:52,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:01:50" (1/3) ... [2024-11-07 11:01:52,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fadf041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:52, skipping insertion in model container [2024-11-07 11:01:52,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:51" (2/3) ... [2024-11-07 11:01:52,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fadf041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:52, skipping insertion in model container [2024-11-07 11:01:52,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:52" (3/3) ... [2024-11-07 11:01:52,167 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-07 11:01:52,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:01:52,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:01:52,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:01:52,246 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;@315c7f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:01:52,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:01:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 11:01:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:01:52,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:52,264 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:52,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 744802952, now seen corresponding path program 1 times [2024-11-07 11:01:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857581392] [2024-11-07 11:01:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:01:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:01:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857581392] [2024-11-07 11:01:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857581392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:52,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:01:52,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626449340] [2024-11-07 11:01:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:52,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:01:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:01:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:52,804 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:01:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:52,840 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2024-11-07 11:01:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:01:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-07 11:01:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:52,850 INFO L225 Difference]: With dead ends: 219 [2024-11-07 11:01:52,851 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 11:01:52,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 11:01:52,859 INFO L432 NwaCegarLoop]: 156 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, 156 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 11:01:52,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 11:01:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 11:01:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 11:01:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-07 11:01:52,908 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-07 11:01:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:52,910 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-07 11:01:52,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:01:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-07 11:01:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:01:52,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:52,913 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:01:52,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1760842982, now seen corresponding path program 1 times [2024-11-07 11:01:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173805117] [2024-11-07 11:01:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:01:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:01:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:53,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173805117] [2024-11-07 11:01:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173805117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399158042] [2024-11-07 11:01:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:53,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:53,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:53,432 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 11:01:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:53,486 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2024-11-07 11:01:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-07 11:01:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:53,491 INFO L225 Difference]: With dead ends: 218 [2024-11-07 11:01:53,492 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 11:01:53,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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 11:01:53,494 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:53,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 11:01:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-07 11:01:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 11:01:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-07 11:01:53,514 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2024-11-07 11:01:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:53,515 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-07 11:01:53,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 11:01:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-07 11:01:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:01:53,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:53,521 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:53,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:01:53,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:53,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1762690024, now seen corresponding path program 1 times [2024-11-07 11:01:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796578574] [2024-11-07 11:01:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:53,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:01:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 11:01:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796578574] [2024-11-07 11:01:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796578574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:01:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389914810] [2024-11-07 11:01:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:01:56,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:56,515 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 11:01:56,517 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 11:01:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:56,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 11:01:56,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:57,019 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 11:01:57,508 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 23 treesize of output 11 [2024-11-07 11:01:57,845 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 23 treesize of output 11 [2024-11-07 11:01:58,135 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 23 treesize of output 11 [2024-11-07 11:01:58,444 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 23 treesize of output 11 [2024-11-07 11:01:58,711 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 23 treesize of output 11 [2024-11-07 11:01:58,938 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 23 treesize of output 11 [2024-11-07 11:01:59,140 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 23 treesize of output 11 [2024-11-07 11:01:59,545 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 23 treesize of output 11 [2024-11-07 11:01:59,782 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 23 treesize of output 11 [2024-11-07 11:02:00,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:00,030 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 23 treesize of output 11 [2024-11-07 11:02:00,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:00,087 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 23 treesize of output 11 [2024-11-07 11:02:00,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-07 11:02:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 184 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-07 11:02:00,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:02:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389914810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:02:00,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 11:02:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 11:02:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11048639] [2024-11-07 11:02:00,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 11:02:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 11:02:00,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 11:02:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-07 11:02:00,258 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 11:02:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:01,127 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2024-11-07 11:02:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:02:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 153 [2024-11-07 11:02:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:01,131 INFO L225 Difference]: With dead ends: 227 [2024-11-07 11:02:01,131 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 11:02:01,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2024-11-07 11:02:01,133 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 136 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:01,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 600 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 11:02:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 11:02:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2024-11-07 11:02:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 11:02:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-11-07 11:02:01,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 153 [2024-11-07 11:02:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-11-07 11:02:01,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 11:02:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-11-07 11:02:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:02:01,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:01,152 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:01,167 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 11:02:01,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:02:01,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2109575446, now seen corresponding path program 1 times [2024-11-07 11:02:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:01,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811061294] [2024-11-07 11:02:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:02:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:02:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811061294] [2024-11-07 11:02:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811061294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:02:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584857210] [2024-11-07 11:02:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:09,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:02:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:02:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:02:09,435 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:02:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:11,668 INFO L93 Difference]: Finished difference Result 283 states and 395 transitions. [2024-11-07 11:02:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:02:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-07 11:02:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:11,671 INFO L225 Difference]: With dead ends: 283 [2024-11-07 11:02:11,671 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 11:02:11,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-07 11:02:11,673 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 433 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:11,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 493 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 11:02:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 11:02:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2024-11-07 11:02:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 111 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 11:02:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-07 11:02:11,699 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 153 [2024-11-07 11:02:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:11,700 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-07 11:02:11,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:02:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-07 11:02:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:02:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:11,702 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:02:11,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 905528172, now seen corresponding path program 1 times [2024-11-07 11:02:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178152470] [2024-11-07 11:02:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:02:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:02:15,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178152470] [2024-11-07 11:02:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178152470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 11:02:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663888341] [2024-11-07 11:02:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:15,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 11:02:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 11:02:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:02:15,766 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 11:02:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:17,312 INFO L93 Difference]: Finished difference Result 315 states and 434 transitions. [2024-11-07 11:02:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:02:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-07 11:02:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:17,314 INFO L225 Difference]: With dead ends: 315 [2024-11-07 11:02:17,314 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 11:02:17,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-07 11:02:17,315 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 276 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:17,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 528 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 11:02:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 11:02:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2024-11-07 11:02:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.3157894736842106) internal successors, (200), 153 states have internal predecessors, (200), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:02:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2024-11-07 11:02:17,352 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 153 [2024-11-07 11:02:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:17,353 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2024-11-07 11:02:17,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 11:02:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2024-11-07 11:02:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:02:17,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:17,355 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:17,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:02:17,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:17,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -186347412, now seen corresponding path program 1 times [2024-11-07 11:02:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181849432] [2024-11-07 11:02:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:02:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:02:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181849432] [2024-11-07 11:02:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181849432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 11:02:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895684823] [2024-11-07 11:02:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:02:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:02:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:02:21,304 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:02:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:22,376 INFO L93 Difference]: Finished difference Result 413 states and 562 transitions. [2024-11-07 11:02:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:02:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-07 11:02:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:22,382 INFO L225 Difference]: With dead ends: 413 [2024-11-07 11:02:22,382 INFO L226 Difference]: Without dead ends: 236 [2024-11-07 11:02:22,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:02:22,383 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 410 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:22,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 402 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 11:02:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-07 11:02:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 184. [2024-11-07 11:02:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.314102564102564) internal successors, (205), 157 states have internal predecessors, (205), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:02:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-07 11:02:22,427 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 153 [2024-11-07 11:02:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:22,427 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-07 11:02:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 11:02:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-07 11:02:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:02:22,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:22,429 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:22,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:02:22,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1466211090, now seen corresponding path program 1 times [2024-11-07 11:02:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225659434] [2024-11-07 11:02:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:02:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 11:02:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225659434] [2024-11-07 11:02:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225659434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 11:02:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077829334] [2024-11-07 11:02:31,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:31,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 11:02:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 11:02:31,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-07 11:02:31,001 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-07 11:02:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:34,427 INFO L93 Difference]: Finished difference Result 403 states and 550 transitions. [2024-11-07 11:02:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:02:34,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-07 11:02:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:34,429 INFO L225 Difference]: With dead ends: 403 [2024-11-07 11:02:34,429 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 11:02:34,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-11-07 11:02:34,430 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 346 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:34,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1064 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 11:02:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 11:02:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 182. [2024-11-07 11:02:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 155 states have internal predecessors, (202), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 11:02:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2024-11-07 11:02:34,498 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 153 [2024-11-07 11:02:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2024-11-07 11:02:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-07 11:02:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2024-11-07 11:02:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 11:02:34,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:34,521 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:02:34,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1455171845, now seen corresponding path program 1 times [2024-11-07 11:02:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31954674] [2024-11-07 11:02:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:02:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 11:02:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31954674] [2024-11-07 11:02:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31954674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:02:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622961244] [2024-11-07 11:02:35,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:35,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:02:35,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:02:35,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:02:35,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 11:02:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:36,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 11:02:36,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:02:37,842 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 11:02:38,578 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 23 treesize of output 11 [2024-11-07 11:02:39,202 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 23 treesize of output 11 [2024-11-07 11:02:39,590 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 23 treesize of output 11 [2024-11-07 11:02:39,975 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 23 treesize of output 11 [2024-11-07 11:02:40,731 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 23 treesize of output 11 [2024-11-07 11:02:41,301 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 23 treesize of output 11 [2024-11-07 11:02:42,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,014 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-07 11:02:42,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 31 [2024-11-07 11:02:42,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,292 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-07 11:02:42,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2024-11-07 11:02:42,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,457 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 37 treesize of output 24 [2024-11-07 11:02:42,538 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-07 11:02:42,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 67 [2024-11-07 11:02:42,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2024-11-07 11:02:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 29 treesize of output 34 [2024-11-07 11:02:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,771 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-07 11:02:42,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 98 [2024-11-07 11:02:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:42,834 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2024-11-07 11:02:42,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 98 [2024-11-07 11:02:43,382 INFO L349 Elim1Store]: treesize reduction 116, result has 37.3 percent of original size [2024-11-07 11:02:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 261 treesize of output 266 [2024-11-07 11:02:45,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,782 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 11:02:45,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2024-11-07 11:02:45,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:45,850 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-07 11:02:45,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 59 [2024-11-07 11:02:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,267 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-07 11:02:46,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 58 [2024-11-07 11:02:46,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,425 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 11:02:46,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2024-11-07 11:02:46,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,448 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-07 11:02:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-11-07 11:02:46,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:46,475 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-07 11:02:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-11-07 11:02:46,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 11:02:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 166 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 11:02:46,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:02:46,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1134 (Array Int Int))) (or (not (= (store (select |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1134)) (< (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2))) is different from false [2024-11-07 11:02:46,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base))) (and (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1134)) (< (select (select (store .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (or (not (= v_ArrVal_1134 (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) is different from false [2024-11-07 11:02:47,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_1132 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1132)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (or (not (= v_ArrVal_1134 (store (select .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select .cse1 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))) (forall ((v_ArrVal_1132 Int)) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1132)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse3 (store .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (or (not (= v_ArrVal_1134 (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select .cse4 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))) is different from false [2024-11-07 11:02:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622961244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:02:58,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 11:02:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2024-11-07 11:02:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423401959] [2024-11-07 11:02:58,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 11:02:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 11:02:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 11:02:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1279, Unknown=11, NotChecked=222, Total=1640 [2024-11-07 11:02:58,003 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand has 30 states, 28 states have (on average 4.321428571428571) internal successors, (121), 29 states have internal predecessors, (121), 8 states have call successors, (38), 4 states have call predecessors, (38), 6 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38)