./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.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-19.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', 'a696e6551ad1205554c4678998c1625e3c8a3a93c97ae7f8e7897edb0d3d5ceb'] 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-19.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 a696e6551ad1205554c4678998c1625e3c8a3a93c97ae7f8e7897edb0d3d5ceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:02,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:02,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:53:02,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:02,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:03,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:03,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:03,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:03,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:03,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:03,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:03,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:03,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:03,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:03,004 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:03,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:03,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:03,004 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:03,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:03,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:03,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:03,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:03,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:03,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:03,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:03,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:03,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:03,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:03,007 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 -> a696e6551ad1205554c4678998c1625e3c8a3a93c97ae7f8e7897edb0d3d5ceb [2024-11-07 10:53:03,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:03,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:03,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:03,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:03,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:03,311 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-19.i [2024-11-07 10:53:04,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:04,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:04,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-19.i [2024-11-07 10:53:04,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/443e47b5e/f0c586d3802f47fbaffb5da13627a4ad/FLAG9b33fa69f [2024-11-07 10:53:04,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/443e47b5e/f0c586d3802f47fbaffb5da13627a4ad [2024-11-07 10:53:04,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:04,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:04,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:04,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:04,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:04,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328d0ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:04, skipping insertion in model container [2024-11-07 10:53:04,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:04" (1/1) ... [2024-11-07 10:53:04,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:05,087 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-19.i[917,930] [2024-11-07 10:53:05,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:05,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:05,184 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-19.i[917,930] [2024-11-07 10:53:05,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:05,259 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:05,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05 WrapperNode [2024-11-07 10:53:05,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:05,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:05,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:05,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:05,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,323 INFO L138 Inliner]: procedures = 27, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-11-07 10:53:05,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:05,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:05,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:05,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:05,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,360 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-07 10:53:05,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:05,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:05,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:05,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:05,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (1/1) ... [2024-11-07 10:53:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:05,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:05,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:53:05,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:53:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:05,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 10:53:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 10:53:05,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:53:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:53:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:53:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:53:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:05,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:05,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:53:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:53:05,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:05,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:05,600 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:05,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:06,114 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:06,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:06,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:06,123 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:06,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:06 BoogieIcfgContainer [2024-11-07 10:53:06,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:06,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:06,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:06,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:06,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:04" (1/3) ... [2024-11-07 10:53:06,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67286941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:06, skipping insertion in model container [2024-11-07 10:53:06,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:05" (2/3) ... [2024-11-07 10:53:06,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67286941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:06, skipping insertion in model container [2024-11-07 10:53:06,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:06" (3/3) ... [2024-11-07 10:53:06,132 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-19.i [2024-11-07 10:53:06,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:06,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:06,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:06,213 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;@36b2ef92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:06,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 10:53:06,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:06,232 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:06,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1029236887, now seen corresponding path program 1 times [2024-11-07 10:53:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781900251] [2024-11-07 10:53:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:06,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781900251] [2024-11-07 10:53:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781900251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:06,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663780750] [2024-11-07 10:53:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:06,705 INFO L87 Difference]: Start difference. First operand has 102 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:53:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:06,732 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2024-11-07 10:53:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:06,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2024-11-07 10:53:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:06,743 INFO L225 Difference]: With dead ends: 197 [2024-11-07 10:53:06,744 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:53:06,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:06,752 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:06,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:53:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 10:53:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2024-11-07 10:53:06,796 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2024-11-07 10:53:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:06,797 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2024-11-07 10:53:06,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:53:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2024-11-07 10:53:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 10:53:06,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:06,800 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:06,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:53:06,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:06,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash 451503243, now seen corresponding path program 1 times [2024-11-07 10:53:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446149122] [2024-11-07 10:53:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:07,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446149122] [2024-11-07 10:53:07,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446149122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339192882] [2024-11-07 10:53:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:07,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:07,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:07,297 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:07,340 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2024-11-07 10:53:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:07,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-07 10:53:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:07,345 INFO L225 Difference]: With dead ends: 196 [2024-11-07 10:53:07,347 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:53:07,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:07,349 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 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 10:53:07,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:53:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-07 10:53:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2024-11-07 10:53:07,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2024-11-07 10:53:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2024-11-07 10:53:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2024-11-07 10:53:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 10:53:07,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:07,376 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:07,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:53:07,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:07,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 453350285, now seen corresponding path program 1 times [2024-11-07 10:53:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801985542] [2024-11-07 10:53:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:53:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801985542] [2024-11-07 10:53:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801985542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:53:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072979457] [2024-11-07 10:53:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:11,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:53:11,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:53:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:11,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:53:11,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:12,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2024-11-07 10:53:12,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:12,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2024-11-07 10:53:12,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:12,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-07 10:53:12,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:12,720 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 195 treesize of output 115 [2024-11-07 10:53:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:53:12,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:53:13,002 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 10:53:13,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 1 [2024-11-07 10:53:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072979457] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:53:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:53:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17, 8] total 24 [2024-11-07 10:53:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498184237] [2024-11-07 10:53:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:13,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:53:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:53:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:53:13,085 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:13,442 INFO L93 Difference]: Finished difference Result 242 states and 340 transitions. [2024-11-07 10:53:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:53:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-07 10:53:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:13,446 INFO L225 Difference]: With dead ends: 242 [2024-11-07 10:53:13,446 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:53:13,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:53:13,449 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 49 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:13,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 588 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:53:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2024-11-07 10:53:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2024-11-07 10:53:13,465 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 132 [2024-11-07 10:53:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2024-11-07 10:53:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2024-11-07 10:53:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 10:53:13,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:13,472 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:53:13,672 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 10:53:13,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1134997617, now seen corresponding path program 1 times [2024-11-07 10:53:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857454596] [2024-11-07 10:53:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857454596] [2024-11-07 10:53:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857454596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695905306] [2024-11-07 10:53:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:14,019 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:14,245 INFO L93 Difference]: Finished difference Result 257 states and 359 transitions. [2024-11-07 10:53:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:53:14,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-07 10:53:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:14,247 INFO L225 Difference]: With dead ends: 257 [2024-11-07 10:53:14,247 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 10:53:14,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:14,248 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:14,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 492 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 10:53:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2024-11-07 10:53:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-11-07 10:53:14,256 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 132 [2024-11-07 10:53:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:14,257 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-11-07 10:53:14,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:14,257 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-11-07 10:53:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:53:14,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:14,261 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:14,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:53:14,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:14,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1820578594, now seen corresponding path program 1 times [2024-11-07 10:53:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139600889] [2024-11-07 10:53:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139600889] [2024-11-07 10:53:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139600889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 10:53:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716527447] [2024-11-07 10:53:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:53:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:53:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:53:18,587 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:53:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:20,073 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2024-11-07 10:53:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:53:20,074 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 133 [2024-11-07 10:53:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:20,076 INFO L225 Difference]: With dead ends: 270 [2024-11-07 10:53:20,077 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 10:53:20,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:53:20,078 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 439 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:20,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 506 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:53:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 10:53:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2024-11-07 10:53:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2024-11-07 10:53:20,106 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 133 [2024-11-07 10:53:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:20,108 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2024-11-07 10:53:20,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:53:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2024-11-07 10:53:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:53:20,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:20,110 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:20,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:53:20,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -857559976, now seen corresponding path program 1 times [2024-11-07 10:53:20,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456261053] [2024-11-07 10:53:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456261053] [2024-11-07 10:53:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456261053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 10:53:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813468697] [2024-11-07 10:53:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:53:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:53:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:53:22,594 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 10:53:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:23,990 INFO L93 Difference]: Finished difference Result 326 states and 452 transitions. [2024-11-07 10:53:23,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:53:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2024-11-07 10:53:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:23,994 INFO L225 Difference]: With dead ends: 326 [2024-11-07 10:53:23,994 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 10:53:23,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:53:23,995 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 309 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:23,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 552 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:53:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 10:53:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 144. [2024-11-07 10:53:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.336) internal successors, (167), 125 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2024-11-07 10:53:24,014 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 134 [2024-11-07 10:53:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:24,014 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2024-11-07 10:53:24,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 10:53:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2024-11-07 10:53:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:53:24,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:24,016 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:24,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:53:24,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 671706015, now seen corresponding path program 1 times [2024-11-07 10:53:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839230860] [2024-11-07 10:53:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:26,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839230860] [2024-11-07 10:53:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839230860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:53:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879056133] [2024-11-07 10:53:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:26,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:53:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:53:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:53:26,416 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 10:53:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:27,621 INFO L93 Difference]: Finished difference Result 335 states and 467 transitions. [2024-11-07 10:53:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:53:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2024-11-07 10:53:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:27,624 INFO L225 Difference]: With dead ends: 335 [2024-11-07 10:53:27,624 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 10:53:27,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:53:27,625 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:27,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 493 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:53:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 10:53:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2024-11-07 10:53:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:53:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 198 transitions. [2024-11-07 10:53:27,642 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 198 transitions. Word has length 134 [2024-11-07 10:53:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:27,643 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 198 transitions. [2024-11-07 10:53:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-07 10:53:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 198 transitions. [2024-11-07 10:53:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:53:27,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:27,644 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:27,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:53:27,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:27,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash -162933833, now seen corresponding path program 1 times [2024-11-07 10:53:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930302645] [2024-11-07 10:53:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:28,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:28,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930302645] [2024-11-07 10:53:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930302645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:28,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:53:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221961882] [2024-11-07 10:53:28,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:53:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:53:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:53:28,558 INFO L87 Difference]: Start difference. First operand 144 states and 198 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:53:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:29,139 INFO L93 Difference]: Finished difference Result 364 states and 499 transitions. [2024-11-07 10:53:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:53:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2024-11-07 10:53:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:29,141 INFO L225 Difference]: With dead ends: 364 [2024-11-07 10:53:29,141 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 10:53:29,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:53:29,142 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 427 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:29,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 378 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:53:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 10:53:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-11-07 10:53:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 190 states have (on average 1.3) internal successors, (247), 191 states have internal predecessors, (247), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:53:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 301 transitions. [2024-11-07 10:53:29,181 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 301 transitions. Word has length 135 [2024-11-07 10:53:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 301 transitions. [2024-11-07 10:53:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:53:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2024-11-07 10:53:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:53:29,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:29,184 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:53:29,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 423872181, now seen corresponding path program 1 times [2024-11-07 10:53:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:29,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645023910] [2024-11-07 10:53:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:53:30,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:30,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645023910] [2024-11-07 10:53:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645023910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:53:30,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543847985] [2024-11-07 10:53:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:30,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:30,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:30,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:53:30,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 10:53:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 10:53:30,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:31,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:53:32,080 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 10:53:32,345 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 10:53:32,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:32,723 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-07 10:53:32,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2024-11-07 10:53:32,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:32,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:32,838 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-07 10:53:32,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 32 [2024-11-07 10:53:32,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:53:32,928 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 10:53:32,964 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 10:53:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 153 proven. 177 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-07 10:53:32,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:53:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543847985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:53:33,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:53:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-07 10:53:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035214372] [2024-11-07 10:53:33,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:53:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 10:53:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 10:53:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:53:33,197 INFO L87 Difference]: Start difference. First operand 220 states and 301 transitions. Second operand has 21 states, 19 states have (on average 5.157894736842105) internal successors, (98), 21 states have internal predecessors, (98), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-07 10:53:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:34,706 INFO L93 Difference]: Finished difference Result 454 states and 618 transitions. [2024-11-07 10:53:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 10:53:34,707 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.157894736842105) internal successors, (98), 21 states have internal predecessors, (98), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 135 [2024-11-07 10:53:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:34,709 INFO L225 Difference]: With dead ends: 454 [2024-11-07 10:53:34,709 INFO L226 Difference]: Without dead ends: 237 [2024-11-07 10:53:34,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=821, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 10:53:34,712 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 412 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:34,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 677 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:53:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-07 10:53:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2024-11-07 10:53:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 187 states have internal predecessors, (234), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 10:53:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2024-11-07 10:53:34,769 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 308 transitions. Word has length 135 [2024-11-07 10:53:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:34,769 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 308 transitions. [2024-11-07 10:53:34,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.157894736842105) internal successors, (98), 21 states have internal predecessors, (98), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-07 10:53:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 308 transitions. [2024-11-07 10:53:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:53:34,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:34,771 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:34,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:53:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:34,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -980582283, now seen corresponding path program 1 times [2024-11-07 10:53:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484399298] [2024-11-07 10:53:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:35,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484399298] [2024-11-07 10:53:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484399298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:35,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:53:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214317794] [2024-11-07 10:53:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:35,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:53:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:53:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:53:35,888 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:36,763 INFO L93 Difference]: Finished difference Result 476 states and 646 transitions. [2024-11-07 10:53:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:53:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-11-07 10:53:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:36,769 INFO L225 Difference]: With dead ends: 476 [2024-11-07 10:53:36,769 INFO L226 Difference]: Without dead ends: 278 [2024-11-07 10:53:36,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:53:36,771 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:36,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1058 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:53:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-07 10:53:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 240. [2024-11-07 10:53:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.2663316582914572) internal successors, (252), 201 states have internal predecessors, (252), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 10:53:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2024-11-07 10:53:36,824 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 135 [2024-11-07 10:53:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:36,826 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2024-11-07 10:53:36,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:53:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2024-11-07 10:53:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:53:36,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:36,829 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:36,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:53:36,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:36,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1120331746, now seen corresponding path program 1 times [2024-11-07 10:53:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561111153] [2024-11-07 10:53:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:53:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:53:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:53:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:53:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561111153] [2024-11-07 10:53:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561111153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:39,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:53:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265857760] [2024-11-07 10:53:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:53:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:53:39,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:53:39,868 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:53:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:40,690 INFO L93 Difference]: Finished difference Result 518 states and 703 transitions. [2024-11-07 10:53:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:53:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 135 [2024-11-07 10:53:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:40,694 INFO L225 Difference]: With dead ends: 518 [2024-11-07 10:53:40,694 INFO L226 Difference]: Without dead ends: 301 [2024-11-07 10:53:40,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:53:40,695 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 486 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:40,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 365 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:53:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-07 10:53:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 233. [2024-11-07 10:53:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 194 states have internal predecessors, (239), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 10:53:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 313 transitions. [2024-11-07 10:53:40,754 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 313 transitions. Word has length 135 [2024-11-07 10:53:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:40,755 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 313 transitions. [2024-11-07 10:53:40,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:53:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 313 transitions. [2024-11-07 10:53:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:53:40,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:40,757 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:40,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:53:40,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:40,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -37594425, now seen corresponding path program 1 times [2024-11-07 10:53:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:40,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181825229] [2024-11-07 10:53:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:53:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601636706] [2024-11-07 10:53:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:40,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:40,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:53:40,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 10:53:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-07 10:53:41,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:41,305 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 43 treesize of output 42 [2024-11-07 10:53:41,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 75 [2024-11-07 10:53:43,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2024-11-07 10:53:45,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 93 [2024-11-07 10:53:47,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 104 [2024-11-07 10:53:49,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 104 [2024-11-07 10:53:51,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 111 [2024-11-07 10:53:54,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 123 [2024-11-07 10:53:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 125 [2024-11-07 10:53:59,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 141 [2024-11-07 10:54:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 182 [2024-11-07 10:54:01,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 520 treesize of output 381