./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --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/nla-digbench-scaling/fermat1-ll_unwindbound10.c', '-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', '4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17'] 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/nla-digbench-scaling/fermat1-ll_unwindbound10.c -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 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:57:17,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:57:17,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:57:17,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:57:17,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:57:17,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:57:17,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:57:17,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:57:17,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:57:17,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:57:17,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:57:17,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:57:17,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:57:17,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:57:17,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:57:17,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:57:17,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:57:17,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:57:17,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:57:17,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:57:17,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:57:17,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:57:17,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:57:17,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:57:17,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:57:17,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:57:17,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:57:17,418 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 -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2024-11-06 22:57:17,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:57:17,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:57:17,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:57:17,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:57:17,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:57:17,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-11-06 22:57:18,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:57:19,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:57:19,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2024-11-06 22:57:19,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bf7095a7/e4800e0e746a4da4816ba6de209e65b9/FLAG57b458b92 [2024-11-06 22:57:19,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bf7095a7/e4800e0e746a4da4816ba6de209e65b9 [2024-11-06 22:57:19,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:57:19,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:57:19,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:57:19,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:57:19,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:57:19,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c28815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19, skipping insertion in model container [2024-11-06 22:57:19,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:57:19,536 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/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-11-06 22:57:19,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:57:19,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:57:19,586 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/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2024-11-06 22:57:19,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:57:19,610 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:57:19,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19 WrapperNode [2024-11-06 22:57:19,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:57:19,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:57:19,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:57:19,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:57:19,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,634 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-11-06 22:57:19,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:57:19,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:57:19,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:57:19,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:57:19,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,658 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 22:57:19,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:57:19,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:57:19,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:57:19,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:57:19,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (1/1) ... [2024-11-06 22:57:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:57:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:19,698 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-06 22:57:19,701 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-06 22:57:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:57:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 22:57:19,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 22:57:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:57:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:57:19,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:57:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 22:57:19,719 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 22:57:19,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:57:19,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:57:19,901 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-06 22:57:19,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:57:19,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:57:19,909 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 22:57:19,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:19 BoogieIcfgContainer [2024-11-06 22:57:19,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:57:19,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:57:19,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:57:19,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:57:19,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:57:19" (1/3) ... [2024-11-06 22:57:19,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:19, skipping insertion in model container [2024-11-06 22:57:19,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:19" (2/3) ... [2024-11-06 22:57:19,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:19, skipping insertion in model container [2024-11-06 22:57:19,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:19" (3/3) ... [2024-11-06 22:57:19,918 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2024-11-06 22:57:19,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:57:19,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:57:19,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:57:19,978 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;@1ec0d6d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:57:19,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:57:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:57:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 22:57:19,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:19,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:19,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:19,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2024-11-06 22:57:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859712451] [2024-11-06 22:57:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:20,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859712451] [2024-11-06 22:57:20,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859712451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:20,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:57:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353483120] [2024-11-06 22:57:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:20,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:57:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:57:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:57:20,126 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:57:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:20,136 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2024-11-06 22:57:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:57:20,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-06 22:57:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:20,141 INFO L225 Difference]: With dead ends: 61 [2024-11-06 22:57:20,141 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 22:57:20,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-06 22:57:20,148 INFO L432 NwaCegarLoop]: 41 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, 41 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-06 22:57:20,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 22:57:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-06 22:57:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:57:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-06 22:57:20,170 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2024-11-06 22:57:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:20,170 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-06 22:57:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:57:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-06 22:57:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:57:20,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:20,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:20,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:57:20,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2024-11-06 22:57:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943820428] [2024-11-06 22:57:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:20,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:20,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943820428] [2024-11-06 22:57:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943820428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:20,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:57:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014624761] [2024-11-06 22:57:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:20,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:57:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:57:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:57:20,267 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:57:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:20,284 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-06 22:57:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:57:20,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-06 22:57:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:20,285 INFO L225 Difference]: With dead ends: 37 [2024-11-06 22:57:20,285 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 22:57:20,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-06 22:57:20,286 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:20,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 22:57:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-06 22:57:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:57:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-06 22:57:20,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2024-11-06 22:57:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-06 22:57:20,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:57:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-06 22:57:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:57:20,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:20,292 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:20,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:57:20,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:20,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2024-11-06 22:57:20,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:20,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694964409] [2024-11-06 22:57:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:57:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311114930] [2024-11-06 22:57:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:20,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:20,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:20,316 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-06 22:57:20,318 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-06 22:57:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:20,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:57:20,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:20,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:57:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694964409] [2024-11-06 22:57:20,538 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:57:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311114930] [2024-11-06 22:57:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311114930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:57:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561505713] [2024-11-06 22:57:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:57:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:57:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:57:20,539 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:57:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:22,027 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-06 22:57:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:57:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-06 22:57:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:22,028 INFO L225 Difference]: With dead ends: 49 [2024-11-06 22:57:22,028 INFO L226 Difference]: Without dead ends: 47 [2024-11-06 22:57:22,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-06 22:57:22,029 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:22,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 22:57:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-06 22:57:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-06 22:57:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:57:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-11-06 22:57:22,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2024-11-06 22:57:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-11-06 22:57:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:57:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-11-06 22:57:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:57:22,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:22,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:22,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:57:22,239 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-06 22:57:22,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:22,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash -82041861, now seen corresponding path program 1 times [2024-11-06 22:57:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446413714] [2024-11-06 22:57:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:22,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446413714] [2024-11-06 22:57:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446413714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104413545] [2024-11-06 22:57:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:22,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:22,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:22,560 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-06 22:57:22,565 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-06 22:57:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:22,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 22:57:22,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:22,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:22,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104413545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:22,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-06 22:57:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162182888] [2024-11-06 22:57:22,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:57:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:57:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:57:22,825 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:57:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:22,955 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-06 22:57:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 22:57:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2024-11-06 22:57:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:22,957 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:57:22,958 INFO L226 Difference]: Without dead ends: 48 [2024-11-06 22:57:22,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:57:22,959 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:22,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 194 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:57:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-06 22:57:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2024-11-06 22:57:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:57:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-06 22:57:22,973 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-11-06 22:57:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:22,974 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-06 22:57:22,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:57:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-06 22:57:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:57:22,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:22,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:22,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 22:57:23,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:23,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1145481658, now seen corresponding path program 1 times [2024-11-06 22:57:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983566408] [2024-11-06 22:57:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983566408] [2024-11-06 22:57:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983566408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:23,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:57:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243564481] [2024-11-06 22:57:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:23,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:57:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:57:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:57:23,256 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:57:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:23,282 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-06 22:57:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:57:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-06 22:57:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:23,287 INFO L225 Difference]: With dead ends: 61 [2024-11-06 22:57:23,287 INFO L226 Difference]: Without dead ends: 40 [2024-11-06 22:57:23,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:57:23,288 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:23,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-06 22:57:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-06 22:57:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 22:57:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-06 22:57:23,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2024-11-06 22:57:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-06 22:57:23,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:57:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-06 22:57:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:57:23,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:23,301 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:23,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:57:23,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1102972225, now seen corresponding path program 1 times [2024-11-06 22:57:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527937779] [2024-11-06 22:57:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:57:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527937779] [2024-11-06 22:57:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527937779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:23,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:57:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885897323] [2024-11-06 22:57:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:23,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:57:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:57:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:57:23,384 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:57:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:23,416 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-06 22:57:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:57:23,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-06 22:57:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:23,417 INFO L225 Difference]: With dead ends: 70 [2024-11-06 22:57:23,417 INFO L226 Difference]: Without dead ends: 49 [2024-11-06 22:57:23,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:57:23,418 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:23,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-06 22:57:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-06 22:57:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-06 22:57:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-06 22:57:23,428 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2024-11-06 22:57:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:23,428 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-06 22:57:23,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:57:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-06 22:57:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 22:57:23,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:23,429 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:57:23,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash 30895492, now seen corresponding path program 1 times [2024-11-06 22:57:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693610073] [2024-11-06 22:57:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:57:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693610073] [2024-11-06 22:57:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693610073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371565772] [2024-11-06 22:57:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:23,531 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-06 22:57:23,551 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-06 22:57:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:23,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:57:23,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:23,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:57:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371565772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:23,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-06 22:57:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885272601] [2024-11-06 22:57:23,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:23,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 22:57:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 22:57:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:57:23,694 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 22:57:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:23,817 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2024-11-06 22:57:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 22:57:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2024-11-06 22:57:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:23,818 INFO L225 Difference]: With dead ends: 125 [2024-11-06 22:57:23,818 INFO L226 Difference]: Without dead ends: 104 [2024-11-06 22:57:23,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:57:23,819 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:23,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 133 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:57:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-06 22:57:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-11-06 22:57:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 22:57:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-06 22:57:23,840 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2024-11-06 22:57:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:23,840 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-06 22:57:23,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 22:57:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-06 22:57:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 22:57:23,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:23,841 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 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-06 22:57:23,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 22:57:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:24,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:24,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash -798356602, now seen corresponding path program 1 times [2024-11-06 22:57:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:24,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377497682] [2024-11-06 22:57:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:57:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377497682] [2024-11-06 22:57:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377497682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:57:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:57:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:57:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226805602] [2024-11-06 22:57:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:57:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:57:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:57:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:57:24,106 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:57:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:24,149 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2024-11-06 22:57:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:57:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2024-11-06 22:57:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:24,151 INFO L225 Difference]: With dead ends: 154 [2024-11-06 22:57:24,151 INFO L226 Difference]: Without dead ends: 115 [2024-11-06 22:57:24,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:57:24,152 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-06 22:57:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2024-11-06 22:57:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-06 22:57:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-06 22:57:24,174 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2024-11-06 22:57:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:24,174 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-06 22:57:24,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 22:57:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-06 22:57:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 22:57:24,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:24,175 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 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-06 22:57:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 22:57:24,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1023958197, now seen corresponding path program 1 times [2024-11-06 22:57:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376854486] [2024-11-06 22:57:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:57:24,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376854486] [2024-11-06 22:57:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376854486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440497579] [2024-11-06 22:57:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:24,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:24,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:24,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:57:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:24,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:57:24,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:24,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:57:24,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440497579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:24,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-06 22:57:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160844761] [2024-11-06 22:57:24,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:57:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:57:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:57:24,432 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-06 22:57:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:24,627 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-11-06 22:57:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 22:57:24,628 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2024-11-06 22:57:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:24,629 INFO L225 Difference]: With dead ends: 215 [2024-11-06 22:57:24,629 INFO L226 Difference]: Without dead ends: 168 [2024-11-06 22:57:24,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:57:24,631 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:24,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 194 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:57:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-06 22:57:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2024-11-06 22:57:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-06 22:57:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2024-11-06 22:57:24,683 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2024-11-06 22:57:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2024-11-06 22:57:24,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-06 22:57:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2024-11-06 22:57:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-06 22:57:24,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:24,686 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:24,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:57:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-06 22:57:24,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1104536814, now seen corresponding path program 1 times [2024-11-06 22:57:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638013131] [2024-11-06 22:57:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:57:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 22:57:25,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638013131] [2024-11-06 22:57:25,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638013131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156569771] [2024-11-06 22:57:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:25,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:25,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:25,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:57:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:57:25,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:25,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 22:57:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156569771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:25,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-06 22:57:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299763529] [2024-11-06 22:57:25,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:25,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 22:57:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 22:57:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:57:25,233 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-06 22:57:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:25,504 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2024-11-06 22:57:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 22:57:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2024-11-06 22:57:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:25,506 INFO L225 Difference]: With dead ends: 207 [2024-11-06 22:57:25,506 INFO L226 Difference]: Without dead ends: 202 [2024-11-06 22:57:25,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-06 22:57:25,507 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 158 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:25,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:57:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-06 22:57:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-06 22:57:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-06 22:57:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2024-11-06 22:57:25,550 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2024-11-06 22:57:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:25,550 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2024-11-06 22:57:25,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-06 22:57:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2024-11-06 22:57:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-06 22:57:25,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:25,554 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:25,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:57:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 22:57:25,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 540498080, now seen corresponding path program 1 times [2024-11-06 22:57:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292415918] [2024-11-06 22:57:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:57:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-06 22:57:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-06 22:57:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-06 22:57:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 22:57:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-06 22:57:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292415918] [2024-11-06 22:57:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292415918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206690481] [2024-11-06 22:57:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:25,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:25,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:25,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:57:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:25,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 22:57:25,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-06 22:57:26,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-06 22:57:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206690481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:26,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-06 22:57:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813964897] [2024-11-06 22:57:26,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:26,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:57:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:57:26,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:57:26,141 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-06 22:57:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:26,247 INFO L93 Difference]: Finished difference Result 487 states and 676 transitions. [2024-11-06 22:57:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:57:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 87 [2024-11-06 22:57:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:26,249 INFO L225 Difference]: With dead ends: 487 [2024-11-06 22:57:26,249 INFO L226 Difference]: Without dead ends: 351 [2024-11-06 22:57:26,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:57:26,250 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:26,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:57:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-06 22:57:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 338. [2024-11-06 22:57:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 254 states have (on average 1.2598425196850394) internal successors, (320), 260 states have internal predecessors, (320), 72 states have call successors, (72), 12 states have call predecessors, (72), 11 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-06 22:57:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 463 transitions. [2024-11-06 22:57:26,330 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 463 transitions. Word has length 87 [2024-11-06 22:57:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:26,330 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 463 transitions. [2024-11-06 22:57:26,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-06 22:57:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 463 transitions. [2024-11-06 22:57:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-06 22:57:26,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:26,332 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:26,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 22:57:26,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 22:57:26,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash -134976430, now seen corresponding path program 2 times [2024-11-06 22:57:26,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699181056] [2024-11-06 22:57:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:57:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-06 22:57:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-06 22:57:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:57:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-06 22:57:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 22:57:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699181056] [2024-11-06 22:57:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699181056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932794291] [2024-11-06 22:57:26,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:57:26,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:26,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:26,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:26,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 22:57:26,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:57:26,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:57:26,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 22:57:26,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:57:26,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 22:57:26,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932794291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:26,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 14 [2024-11-06 22:57:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139068431] [2024-11-06 22:57:26,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 22:57:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:26,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 22:57:26,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:57:26,969 INFO L87 Difference]: Start difference. First operand 338 states and 463 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 11 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-11-06 22:57:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:27,180 INFO L93 Difference]: Finished difference Result 467 states and 642 transitions. [2024-11-06 22:57:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-06 22:57:27,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 11 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 87 [2024-11-06 22:57:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:27,182 INFO L225 Difference]: With dead ends: 467 [2024-11-06 22:57:27,182 INFO L226 Difference]: Without dead ends: 348 [2024-11-06 22:57:27,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 184 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2024-11-06 22:57:27,183 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 73 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:27,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 206 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:57:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-06 22:57:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2024-11-06 22:57:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 262 states have (on average 1.213740458015267) internal successors, (318), 262 states have internal predecessors, (318), 70 states have call successors, (70), 12 states have call predecessors, (70), 11 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-06 22:57:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2024-11-06 22:57:27,242 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 87 [2024-11-06 22:57:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:27,243 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2024-11-06 22:57:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 11 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-11-06 22:57:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2024-11-06 22:57:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 22:57:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:27,244 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:27,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 22:57:27,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:27,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:27,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2132027339, now seen corresponding path program 1 times [2024-11-06 22:57:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115936671] [2024-11-06 22:57:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:57:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:57:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:57:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 22:57:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:57:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:57:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-06 22:57:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-06 22:57:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:57:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 22:57:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-06 22:57:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-06 22:57:27,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:57:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115936671] [2024-11-06 22:57:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115936671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:57:27,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726056145] [2024-11-06 22:57:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:27,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:27,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 22:57:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:57:27,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 22:57:27,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:57:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:57:27,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:57:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-06 22:57:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726056145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:57:27,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:57:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 13 [2024-11-06 22:57:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305483093] [2024-11-06 22:57:27,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:57:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:57:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:57:27,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:57:27,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:57:27,942 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-06 22:57:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:57:28,141 INFO L93 Difference]: Finished difference Result 453 states and 618 transitions. [2024-11-06 22:57:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 22:57:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 93 [2024-11-06 22:57:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:57:28,144 INFO L225 Difference]: With dead ends: 453 [2024-11-06 22:57:28,144 INFO L226 Difference]: Without dead ends: 342 [2024-11-06 22:57:28,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2024-11-06 22:57:28,144 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:57:28,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 162 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:57:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-06 22:57:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-06 22:57:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 260 states have (on average 1.1961538461538461) internal successors, (311), 260 states have internal predecessors, (311), 70 states have call successors, (70), 12 states have call predecessors, (70), 11 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-06 22:57:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 450 transitions. [2024-11-06 22:57:28,209 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 450 transitions. Word has length 93 [2024-11-06 22:57:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:57:28,209 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 450 transitions. [2024-11-06 22:57:28,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-06 22:57:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 450 transitions. [2024-11-06 22:57:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 22:57:28,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:57:28,211 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:28,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-06 22:57:28,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:28,416 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:57:28,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:57:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash 519126930, now seen corresponding path program 1 times [2024-11-06 22:57:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:57:28,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891784004] [2024-11-06 22:57:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:57:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:57:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777108489] [2024-11-06 22:57:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:57:28,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:28,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:57:28,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:57:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 22:57:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:57:28,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:57:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:57:28,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 22:57:28,553 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:57:28,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:57:28,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-06 22:57:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:57:28,758 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:57:28,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:57:28,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:57:28 BoogieIcfgContainer [2024-11-06 22:57:28,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:57:28,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:57:28,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:57:28,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:57:28,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:19" (3/4) ... [2024-11-06 22:57:28,786 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 22:57:28,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:57:28,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:57:28,816 INFO L158 Benchmark]: Toolchain (without parser) took 9394.85ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 118.1MB in the beginning and 118.3MB in the end (delta: -237.8kB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 80.6MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.86ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 106.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.92ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: Boogie Preprocessor took 33.99ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 104.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: RCFGBuilder took 238.88ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 92.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,816 INFO L158 Benchmark]: TraceAbstraction took 8873.31ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 92.1MB in the beginning and 123.0MB in the end (delta: -30.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,817 INFO L158 Benchmark]: Witness Printer took 30.07ms. Allocated memory is still 218.1MB. Free memory was 123.0MB in the beginning and 118.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:57:28,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 80.6MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.86ms. Allocated memory is still 142.6MB. Free memory was 117.9MB in the beginning and 106.6MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.92ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.99ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 104.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 238.88ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 92.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8873.31ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 92.1MB in the beginning and 123.0MB in the end (delta: -30.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 30.07ms. Allocated memory is still 218.1MB. Free memory was 123.0MB in the beginning and 118.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=13, R=3, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=13, R=3, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=13, counter=0, r=-4, u=7, v=1] [L34] EXPR counter++ VAL [A=13, counter=1, r=-4, u=7, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=1, r=-4, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=13, counter=1, r=-4, u=7, v=1] [L39] EXPR counter++ VAL [A=13, counter=2, r=-4, u=7, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=2, r=-4, u=7, v=1] [L41] COND TRUE !(r > 0) VAL [A=13, counter=2, r=-4, u=7, v=1] [L47] EXPR counter++ VAL [A=13, counter=3, r=-4, u=7, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=3, r=-4, u=7, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=13, counter=3, r=3, u=9, v=1] [L47] EXPR counter++ VAL [A=13, counter=4, r=3, u=9, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=4, r=3, u=9, v=1] [L49] COND TRUE !(r < 0) VAL [A=13, counter=4, r=3, u=9, v=1] [L34] EXPR counter++ VAL [A=13, counter=5, r=3, u=9, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=5, r=3, u=9, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=13, counter=5, r=3, u=9, v=1] [L39] EXPR counter++ VAL [A=13, counter=6, r=3, u=9, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=6, r=3, u=9, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13, counter=6, r=2, u=9, v=3] [L39] EXPR counter++ VAL [A=13, counter=7, r=2, u=9, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=7, r=2, u=9, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=13, counter=7, r=-1, u=9, v=5] [L39] EXPR counter++ VAL [A=13, counter=8, r=-1, u=9, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=8, r=-1, u=9, v=5] [L41] COND TRUE !(r > 0) VAL [A=13, counter=8, r=-1, u=9, v=5] [L47] EXPR counter++ VAL [A=13, counter=9, r=-1, u=9, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=9, r=-1, u=9, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=13, counter=9, r=8, u=11, v=5] [L47] EXPR counter++ VAL [A=13, counter=10, r=8, u=11, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=13, counter=10, r=8, u=11, v=5] [L49] COND TRUE !(r < 0) VAL [A=13, counter=10, r=8, u=11, v=5] [L34] EXPR counter++ VAL [A=13, counter=11, r=8, u=11, v=5] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 611 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 1809 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1342 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 467 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 960 SyntacticMatches, 20 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=12, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1238 NumberOfCodeBlocks, 1238 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 3092 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1491/2044 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 22:57:28,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE