./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:53:17,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:53:17,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:53:17,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:53:17,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:53:17,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:53:17,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:53:17,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:53:17,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:53:17,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:53:17,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:53:17,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:53:17,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:53:17,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:53:17,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:53:17,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:53:17,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:53:17,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:53:17,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:53:17,469 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 -> 6c4f2ab200ae95c9ca275594b018c3497d9548a4085e649d22d856974a67d096 [2024-11-07 07:53:17,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:53:17,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:53:17,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:53:17,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:53:17,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:53:17,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-07 07:53:19,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:53:19,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:53:19,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-07 07:53:19,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/672603114/34e8b53ddb9b46cba73bfabf3cc8285e/FLAG4887f6f8e [2024-11-07 07:53:19,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/672603114/34e8b53ddb9b46cba73bfabf3cc8285e [2024-11-07 07:53:19,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:53:19,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:53:19,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:53:19,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:53:19,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:53:19,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5711e4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19, skipping insertion in model container [2024-11-07 07:53:19,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:53:19,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2024-11-07 07:53:19,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:53:19,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:53:19,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-89.i[916,929] [2024-11-07 07:53:19,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:53:19,643 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:53:19,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19 WrapperNode [2024-11-07 07:53:19,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:53:19,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:53:19,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:53:19,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:53:19,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,700 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-07 07:53:19,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:53:19,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:53:19,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:53:19,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:53:19,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,727 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-07 07:53:19,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:53:19,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:53:19,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:53:19,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:53:19,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (1/1) ... [2024-11-07 07:53:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:53:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:53:19,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:53:19,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:53:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:53:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:53:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:53:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:53:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:53:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:53:19,890 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:53:19,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:53:20,209 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 07:53:20,211 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:53:20,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:53:20,226 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:53:20,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:53:20 BoogieIcfgContainer [2024-11-07 07:53:20,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:53:20,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:53:20,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:53:20,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:53:20,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:53:19" (1/3) ... [2024-11-07 07:53:20,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c4ea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:53:20, skipping insertion in model container [2024-11-07 07:53:20,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:53:19" (2/3) ... [2024-11-07 07:53:20,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c4ea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:53:20, skipping insertion in model container [2024-11-07 07:53:20,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:53:20" (3/3) ... [2024-11-07 07:53:20,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-89.i [2024-11-07 07:53:20,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:53:20,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:53:20,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:53:20,309 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;@134234bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:53:20,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:53:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:53:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 07:53:20,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:20,324 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:20,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1313284559, now seen corresponding path program 1 times [2024-11-07 07:53:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625253327] [2024-11-07 07:53:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:20,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:20,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625253327] [2024-11-07 07:53:20,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625253327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:20,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:20,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:53:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933800518] [2024-11-07 07:53:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:20,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:53:20,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:20,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:53:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:53:20,633 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:53:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:20,660 INFO L93 Difference]: Finished difference Result 119 states and 195 transitions. [2024-11-07 07:53:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:53:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2024-11-07 07:53:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:20,669 INFO L225 Difference]: With dead ends: 119 [2024-11-07 07:53:20,670 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 07:53:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:53:20,676 INFO L432 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:20,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:53:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 07:53:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 07:53:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 07:53:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-11-07 07:53:20,717 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 87 [2024-11-07 07:53:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:20,717 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-11-07 07:53:20,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 07:53:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-11-07 07:53:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 07:53:20,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:20,720 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:20,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:53:20,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1981552013, now seen corresponding path program 1 times [2024-11-07 07:53:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175573521] [2024-11-07 07:53:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:20,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175573521] [2024-11-07 07:53:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175573521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:53:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606462815] [2024-11-07 07:53:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:53:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:53:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:53:21,396 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:21,656 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2024-11-07 07:53:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:53:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-07 07:53:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:21,660 INFO L225 Difference]: With dead ends: 172 [2024-11-07 07:53:21,661 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 07:53:21,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:53:21,664 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:21,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:53:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 07:53:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-11-07 07:53:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:53:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-07 07:53:21,685 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 87 [2024-11-07 07:53:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:21,686 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-07 07:53:21,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2024-11-07 07:53:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 07:53:21,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:21,688 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:53:21,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1612350705, now seen corresponding path program 1 times [2024-11-07 07:53:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925136567] [2024-11-07 07:53:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925136567] [2024-11-07 07:53:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925136567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:24,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:53:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611684504] [2024-11-07 07:53:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:53:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:24,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:53:24,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:53:24,808 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:25,332 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2024-11-07 07:53:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:53:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-07 07:53:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:25,335 INFO L225 Difference]: With dead ends: 170 [2024-11-07 07:53:25,335 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 07:53:25,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:53:25,336 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 123 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:25,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 176 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:53:25,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 07:53:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-07 07:53:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:53:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-07 07:53:25,362 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 87 [2024-11-07 07:53:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:25,363 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-07 07:53:25,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-07 07:53:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 07:53:25,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:25,365 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:53:25,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -932292335, now seen corresponding path program 1 times [2024-11-07 07:53:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152543291] [2024-11-07 07:53:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152543291] [2024-11-07 07:53:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152543291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:53:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268939629] [2024-11-07 07:53:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:27,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:53:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:53:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:53:27,313 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:27,819 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-07 07:53:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:53:27,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-11-07 07:53:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:27,822 INFO L225 Difference]: With dead ends: 181 [2024-11-07 07:53:27,822 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 07:53:27,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:53:27,823 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:27,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 202 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:53:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 07:53:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2024-11-07 07:53:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:53:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-07 07:53:27,842 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 87 [2024-11-07 07:53:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:27,843 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-07 07:53:27,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-07 07:53:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 07:53:27,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:27,846 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:27,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:53:27,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1191211448, now seen corresponding path program 1 times [2024-11-07 07:53:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198976709] [2024-11-07 07:53:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:28,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198976709] [2024-11-07 07:53:28,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198976709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:28,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:28,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:53:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479354194] [2024-11-07 07:53:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:28,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:53:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:53:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:53:28,688 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:29,264 INFO L93 Difference]: Finished difference Result 202 states and 290 transitions. [2024-11-07 07:53:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:53:29,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-11-07 07:53:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:29,267 INFO L225 Difference]: With dead ends: 202 [2024-11-07 07:53:29,267 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 07:53:29,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:53:29,269 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 100 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:29,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 468 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:53:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 07:53:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-07 07:53:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.22) internal successors, (122), 100 states have internal predecessors, (122), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 07:53:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2024-11-07 07:53:29,294 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 89 [2024-11-07 07:53:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:29,294 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2024-11-07 07:53:29,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2024-11-07 07:53:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 07:53:29,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:29,296 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:53:29,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1611278920, now seen corresponding path program 1 times [2024-11-07 07:53:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105192937] [2024-11-07 07:53:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105192937] [2024-11-07 07:53:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105192937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:53:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272323025] [2024-11-07 07:53:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:53:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:53:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:29,505 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:29,584 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2024-11-07 07:53:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:53:29,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-07 07:53:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:29,587 INFO L225 Difference]: With dead ends: 275 [2024-11-07 07:53:29,587 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 07:53:29,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:29,588 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:29,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:53:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 07:53:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2024-11-07 07:53:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 106 states have internal predecessors, (128), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 07:53:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 206 transitions. [2024-11-07 07:53:29,617 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 206 transitions. Word has length 91 [2024-11-07 07:53:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:29,618 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 206 transitions. [2024-11-07 07:53:29,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 206 transitions. [2024-11-07 07:53:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 07:53:29,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:29,620 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:53:29,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1697688837, now seen corresponding path program 1 times [2024-11-07 07:53:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635341114] [2024-11-07 07:53:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:30,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635341114] [2024-11-07 07:53:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635341114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:53:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821347526] [2024-11-07 07:53:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:30,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:53:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:53:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:53:30,481 INFO L87 Difference]: Start difference. First operand 149 states and 206 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:31,270 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2024-11-07 07:53:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:53:31,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 07:53:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:31,272 INFO L225 Difference]: With dead ends: 165 [2024-11-07 07:53:31,272 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 07:53:31,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:53:31,273 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 171 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:31,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 377 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:53:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 07:53:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2024-11-07 07:53:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 112 states have internal predecessors, (134), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 07:53:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2024-11-07 07:53:31,306 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 92 [2024-11-07 07:53:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:31,306 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2024-11-07 07:53:31,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2024-11-07 07:53:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 07:53:31,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:31,308 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:31,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:53:31,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:31,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -591190857, now seen corresponding path program 1 times [2024-11-07 07:53:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023507864] [2024-11-07 07:53:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:31,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023507864] [2024-11-07 07:53:31,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023507864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:31,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:31,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:53:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64544510] [2024-11-07 07:53:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:31,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:53:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:53:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:31,391 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:31,448 INFO L93 Difference]: Finished difference Result 335 states and 452 transitions. [2024-11-07 07:53:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:53:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-07 07:53:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:31,450 INFO L225 Difference]: With dead ends: 335 [2024-11-07 07:53:31,450 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 07:53:31,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:31,451 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:31,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:53:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 07:53:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-07 07:53:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 07:53:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 277 transitions. [2024-11-07 07:53:31,490 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 277 transitions. Word has length 99 [2024-11-07 07:53:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:31,491 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 277 transitions. [2024-11-07 07:53:31,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 277 transitions. [2024-11-07 07:53:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:53:31,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:31,492 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:53:31,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:31,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -867068570, now seen corresponding path program 1 times [2024-11-07 07:53:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722684361] [2024-11-07 07:53:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722684361] [2024-11-07 07:53:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722684361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:53:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495398202] [2024-11-07 07:53:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:32,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:53:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:53:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:53:32,945 INFO L87 Difference]: Start difference. First operand 207 states and 277 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:34,584 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2024-11-07 07:53:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 07:53:34,585 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2024-11-07 07:53:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:34,590 INFO L225 Difference]: With dead ends: 258 [2024-11-07 07:53:34,590 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 07:53:34,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 07:53:34,591 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 143 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:34,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 602 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:53:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 07:53:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2024-11-07 07:53:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 159 states have (on average 1.1635220125786163) internal successors, (185), 161 states have internal predecessors, (185), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 07:53:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 291 transitions. [2024-11-07 07:53:34,622 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 291 transitions. Word has length 105 [2024-11-07 07:53:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 291 transitions. [2024-11-07 07:53:34,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2024-11-07 07:53:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 07:53:34,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:34,626 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:53:34,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1127076136, now seen corresponding path program 1 times [2024-11-07 07:53:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330242511] [2024-11-07 07:53:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 07:53:34,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:34,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330242511] [2024-11-07 07:53:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330242511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:34,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:34,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:53:34,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400286232] [2024-11-07 07:53:34,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:34,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:53:34,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:34,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:53:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:53:34,769 INFO L87 Difference]: Start difference. First operand 219 states and 291 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:34,880 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2024-11-07 07:53:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:53:34,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2024-11-07 07:53:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:34,883 INFO L225 Difference]: With dead ends: 389 [2024-11-07 07:53:34,883 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 07:53:34,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:53:34,884 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:34,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:53:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 07:53:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-07 07:53:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1538461538461537) internal successors, (165), 145 states have internal predecessors, (165), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 07:53:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2024-11-07 07:53:34,915 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 271 transitions. Word has length 105 [2024-11-07 07:53:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 271 transitions. [2024-11-07 07:53:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 271 transitions. [2024-11-07 07:53:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-07 07:53:34,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:34,920 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-07 07:53:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:53:34,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:34,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 821982124, now seen corresponding path program 1 times [2024-11-07 07:53:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316753065] [2024-11-07 07:53:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-11-07 07:53:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316753065] [2024-11-07 07:53:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316753065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:37,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 07:53:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527052739] [2024-11-07 07:53:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:53:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:53:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:53:37,438 INFO L87 Difference]: Start difference. First operand 203 states and 271 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:38,421 INFO L93 Difference]: Finished difference Result 398 states and 529 transitions. [2024-11-07 07:53:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 07:53:38,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2024-11-07 07:53:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:38,425 INFO L225 Difference]: With dead ends: 398 [2024-11-07 07:53:38,427 INFO L226 Difference]: Without dead ends: 310 [2024-11-07 07:53:38,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:53:38,428 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:38,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 807 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 07:53:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-07 07:53:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2024-11-07 07:53:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.180952380952381) internal successors, (248), 214 states have internal predecessors, (248), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 07:53:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2024-11-07 07:53:38,478 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 181 [2024-11-07 07:53:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2024-11-07 07:53:38,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2024-11-07 07:53:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 07:53:38,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:38,484 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:38,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:53:38,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:38,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:38,485 INFO L85 PathProgramCache]: Analyzing trace with hash -762564678, now seen corresponding path program 1 times [2024-11-07 07:53:38,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:38,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463983256] [2024-11-07 07:53:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:38,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-07 07:53:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463983256] [2024-11-07 07:53:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463983256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:38,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:53:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058852181] [2024-11-07 07:53:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:53:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:53:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:38,597 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:38,700 INFO L93 Difference]: Finished difference Result 624 states and 839 transitions. [2024-11-07 07:53:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:53:38,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 184 [2024-11-07 07:53:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:38,704 INFO L225 Difference]: With dead ends: 624 [2024-11-07 07:53:38,704 INFO L226 Difference]: Without dead ends: 451 [2024-11-07 07:53:38,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:38,705 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:38,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:53:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-07 07:53:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 293. [2024-11-07 07:53:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 219 states have internal predecessors, (254), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 07:53:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2024-11-07 07:53:38,761 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 184 [2024-11-07 07:53:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2024-11-07 07:53:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2024-11-07 07:53:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-07 07:53:38,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:38,766 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:53:38,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:38,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash -181504122, now seen corresponding path program 1 times [2024-11-07 07:53:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339605396] [2024-11-07 07:53:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 07:53:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339605396] [2024-11-07 07:53:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339605396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:53:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299035858] [2024-11-07 07:53:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:53:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:53:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:53:38,969 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:39,126 INFO L93 Difference]: Finished difference Result 654 states and 877 transitions. [2024-11-07 07:53:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:53:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2024-11-07 07:53:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:39,131 INFO L225 Difference]: With dead ends: 654 [2024-11-07 07:53:39,131 INFO L226 Difference]: Without dead ends: 476 [2024-11-07 07:53:39,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-07 07:53:39,132 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:39,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 262 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:53:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-07 07:53:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 408. [2024-11-07 07:53:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 290 states have (on average 1.1275862068965516) internal successors, (327), 297 states have internal predecessors, (327), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-07 07:53:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 537 transitions. [2024-11-07 07:53:39,204 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 537 transitions. Word has length 187 [2024-11-07 07:53:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:39,204 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 537 transitions. [2024-11-07 07:53:39,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 537 transitions. [2024-11-07 07:53:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 07:53:39,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:39,207 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:39,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 07:53:39,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:39,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1603055788, now seen corresponding path program 1 times [2024-11-07 07:53:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003471582] [2024-11-07 07:53:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 07:53:40,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:40,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003471582] [2024-11-07 07:53:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003471582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:40,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 07:53:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361316204] [2024-11-07 07:53:40,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:40,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:53:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:53:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:53:40,475 INFO L87 Difference]: Start difference. First operand 408 states and 537 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:41,067 INFO L93 Difference]: Finished difference Result 535 states and 668 transitions. [2024-11-07 07:53:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:53:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2024-11-07 07:53:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:41,071 INFO L225 Difference]: With dead ends: 535 [2024-11-07 07:53:41,071 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 07:53:41,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-07 07:53:41,072 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 160 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:41,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 422 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:53:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 07:53:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 432. [2024-11-07 07:53:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 314 states have (on average 1.1305732484076434) internal successors, (355), 321 states have internal predecessors, (355), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-07 07:53:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 565 transitions. [2024-11-07 07:53:41,131 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 565 transitions. Word has length 191 [2024-11-07 07:53:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 565 transitions. [2024-11-07 07:53:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 565 transitions. [2024-11-07 07:53:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 07:53:41,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:41,136 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:41,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 07:53:41,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:41,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -697766802, now seen corresponding path program 1 times [2024-11-07 07:53:41,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:41,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103926302] [2024-11-07 07:53:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-07 07:53:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103926302] [2024-11-07 07:53:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103926302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:53:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884111754] [2024-11-07 07:53:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:53:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:53:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:53:41,351 INFO L87 Difference]: Start difference. First operand 432 states and 565 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:41,589 INFO L93 Difference]: Finished difference Result 796 states and 1043 transitions. [2024-11-07 07:53:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:53:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2024-11-07 07:53:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:41,593 INFO L225 Difference]: With dead ends: 796 [2024-11-07 07:53:41,593 INFO L226 Difference]: Without dead ends: 479 [2024-11-07 07:53:41,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:53:41,595 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 126 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:41,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 306 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:53:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-07 07:53:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 329. [2024-11-07 07:53:41,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 233 states have (on average 1.1158798283261802) internal successors, (260), 239 states have internal predecessors, (260), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-07 07:53:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 430 transitions. [2024-11-07 07:53:41,664 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 430 transitions. Word has length 191 [2024-11-07 07:53:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:41,664 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 430 transitions. [2024-11-07 07:53:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 430 transitions. [2024-11-07 07:53:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-07 07:53:41,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:41,668 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 07:53:41,668 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 115108212, now seen corresponding path program 2 times [2024-11-07 07:53:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453790277] [2024-11-07 07:53:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:53:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 07:53:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 07:53:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 07:53:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 07:53:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 07:53:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 07:53:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 07:53:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 07:53:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-07 07:53:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 07:53:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 07:53:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 07:53:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 2986 trivial. 0 not checked. [2024-11-07 07:53:43,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453790277] [2024-11-07 07:53:43,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453790277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:53:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405415711] [2024-11-07 07:53:43,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 07:53:43,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:53:43,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:53:43,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:53:43,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:53:43,322 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 07:53:43,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 07:53:43,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 07:53:43,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:53:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2024-11-07 07:53:43,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:53:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405415711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:53:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-11-07 07:53:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503632957] [2024-11-07 07:53:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:43,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:53:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:43,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:53:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-11-07 07:53:43,868 INFO L87 Difference]: Start difference. First operand 329 states and 430 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:44,791 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2024-11-07 07:53:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 07:53:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 267 [2024-11-07 07:53:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:44,794 INFO L225 Difference]: With dead ends: 384 [2024-11-07 07:53:44,794 INFO L226 Difference]: Without dead ends: 382 [2024-11-07 07:53:44,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 338 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 07:53:44,796 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 200 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:44,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 430 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:53:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-07 07:53:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 325. [2024-11-07 07:53:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 229 states have (on average 1.1135371179039302) internal successors, (255), 235 states have internal predecessors, (255), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-07 07:53:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 425 transitions. [2024-11-07 07:53:44,854 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 425 transitions. Word has length 267 [2024-11-07 07:53:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 425 transitions. [2024-11-07 07:53:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2024-11-07 07:53:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-07 07:53:44,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:53:44,858 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 07:53:44,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:53:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 07:53:45,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:53:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:53:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1042737457, now seen corresponding path program 1 times [2024-11-07 07:53:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:53:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245550254] [2024-11-07 07:53:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:53:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:53:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:53:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:53:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:53:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:53:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:53:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:53:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:53:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:53:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:53:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:53:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:53:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:53:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:53:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:53:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:53:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:53:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:53:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:53:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:53:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:53:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:53:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:53:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 07:53:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 07:53:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 07:53:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 07:53:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 07:53:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 07:53:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 07:53:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 07:53:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 07:53:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 07:53:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 07:53:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-07 07:53:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-07 07:53:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-07 07:53:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-07 07:53:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 07:53:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 07:53:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:53:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2024-11-07 07:53:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:53:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245550254] [2024-11-07 07:53:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245550254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:53:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:53:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:53:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789250903] [2024-11-07 07:53:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:53:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:53:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:53:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:53:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:45,197 INFO L87 Difference]: Start difference. First operand 325 states and 425 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:53:45,319 INFO L93 Difference]: Finished difference Result 713 states and 940 transitions. [2024-11-07 07:53:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:53:45,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 272 [2024-11-07 07:53:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:53:45,322 INFO L225 Difference]: With dead ends: 713 [2024-11-07 07:53:45,322 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 07:53:45,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:53:45,324 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:53:45,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:53:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 07:53:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 07:53:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 07:53:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 07:53:45,325 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2024-11-07 07:53:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:53:45,325 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 07:53:45,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 07:53:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 07:53:45,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 07:53:45,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:53:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 07:53:45,332 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:53:45,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 07:54:07,289 WARN L286 SmtUtils]: Spent 21.43s on a formula simplification. DAG size of input: 284 DAG size of output: 363 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-07 07:54:12,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:54:12,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:54:12 BoogieIcfgContainer [2024-11-07 07:54:12,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:54:12,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:54:12,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:54:12,651 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:54:12,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:53:20" (3/4) ... [2024-11-07 07:54:12,654 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 07:54:12,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 07:54:12,666 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 07:54:12,666 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 07:54:12,666 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 07:54:12,666 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 07:54:12,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 07:54:12,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 07:54:12,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:54:12,773 INFO L158 Benchmark]: Toolchain (without parser) took 53423.72ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 91.4MB in the beginning and 280.3MB in the end (delta: -188.9MB). Peak memory consumption was 444.0MB. Max. memory is 16.1GB. [2024-11-07 07:54:12,774 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:54:12,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.61ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:54:12,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.27ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:54:12,774 INFO L158 Benchmark]: Boogie Preprocessor took 36.58ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:54:12,775 INFO L158 Benchmark]: RCFGBuilder took 483.89ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 54.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:54:12,775 INFO L158 Benchmark]: TraceAbstraction took 52420.09ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 53.5MB in the beginning and 284.4MB in the end (delta: -230.9MB). Peak memory consumption was 421.5MB. Max. memory is 16.1GB. [2024-11-07 07:54:12,775 INFO L158 Benchmark]: Witness Printer took 121.96ms. Allocated memory is still 755.0MB. Free memory was 284.4MB in the beginning and 280.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:54:12,776 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.61ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.27ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.58ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 73.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 483.89ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 54.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 52420.09ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 53.5MB in the beginning and 284.4MB in the end (delta: -230.9MB). Peak memory consumption was 421.5MB. Max. memory is 16.1GB. * Witness Printer took 121.96ms. Allocated memory is still 755.0MB. Free memory was 284.4MB in the beginning and 280.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 17, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1585 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1585 mSDsluCounter, 5244 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4170 IncrementalHoareTripleChecker+Invalid, 4359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1656 mSDtfsCounter, 4170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=14, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 696 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2432 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 10479 SizeOfPredicates, 11 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 18966/18977 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && ((var_1_7 == 0) || (var_1_5 == 0))) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && ((var_1_8 + 1) == 0)) || ((((((var_1_1 == 1) || (var_1_1 == 0)) && ((((var_1_8 != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((3 + var_1_10) < var_1_9) || (var_1_8 == ((252 + var_1_9) % 256))) && (((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)) <= 127))) && ((var_1_8 == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((((3 + var_1_10) < var_1_9) || ((256 + var_1_8) == ((252 + var_1_9) % 256))) && (128 <= ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) || ((256 + var_1_8) != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) && (((((var_1_9 <= (3 + var_1_10)) && ((256 + var_1_8) == ((252 + var_1_9) % 256))) || (((252 + var_1_9) % 256) < 128)) && ((127 < ((252 + var_1_9) % 256)) || ((var_1_8 == ((252 + var_1_9) % 256)) && (var_1_9 <= (3 + var_1_10))))) || ((256 + var_1_8) == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))))))) || (last_1_var_1_14 < (last_1_var_1_15 + 1)))) && (var_1_13 == var_1_10)) && (var_1_8 == var_1_14)) && (var_1_15 == var_1_3))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) Ensures: (((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_14 == \old(last_1_var_1_14))) && (last_1_var_1_15 == \old(last_1_var_1_15)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 07:54:12,922 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 Result: TRUE