./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.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', '1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.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 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:00:21,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:00:21,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:00:21,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:00:21,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:00:21,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:00:21,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:00:21,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:00:21,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:00:21,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:00:21,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:00:21,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:00:21,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:00:21,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:00:21,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:00:21,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:00:21,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:00:21,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:00:21,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:00:21,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:00:21,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:00:21,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:00:21,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:00:21,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:00:21,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:00:21,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:00:21,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:00:21,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:21,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:00:21,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:00:21,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:00:21,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:00:21,178 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 -> 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 [2024-11-07 11:00:21,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:00:21,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:00:21,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:00:21,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:00:21,438 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:00:21,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-07 11:00:22,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:00:22,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:00:22,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-07 11:00:22,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a7ce2878/eacb4b5d9c92452988f1ac066cfe57a5/FLAG55d7f75e9 [2024-11-07 11:00:23,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a7ce2878/eacb4b5d9c92452988f1ac066cfe57a5 [2024-11-07 11:00:23,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:00:23,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:00:23,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:23,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:00:23,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:00:23,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b81f1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23, skipping insertion in model container [2024-11-07 11:00:23,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:00:23,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-11-07 11:00:23,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:23,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:00:23,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-11-07 11:00:23,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:00:23,546 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:00:23,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23 WrapperNode [2024-11-07 11:00:23,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:00:23,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:23,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:00:23,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:00:23,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,618 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-11-07 11:00:23,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:00:23,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:00:23,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:00:23,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:00:23,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,651 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 11:00:23,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:00:23,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:00:23,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:00:23,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:00:23,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (1/1) ... [2024-11-07 11:00:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:00:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:00:23,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:00:23,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:00:23,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:00:23,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 11:00:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:00:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:00:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 11:00:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:00:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:00:23,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:00:23,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:00:24,339 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-07 11:00:24,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:00:24,354 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:00:24,355 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:00:24,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:00:24 BoogieIcfgContainer [2024-11-07 11:00:24,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:00:24,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:00:24,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:00:24,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:00:24,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:00:23" (1/3) ... [2024-11-07 11:00:24,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141859c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:00:24, skipping insertion in model container [2024-11-07 11:00:24,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:00:23" (2/3) ... [2024-11-07 11:00:24,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141859c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:00:24, skipping insertion in model container [2024-11-07 11:00:24,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:00:24" (3/3) ... [2024-11-07 11:00:24,367 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-79.i [2024-11-07 11:00:24,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:00:24,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:00:24,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:00:24,430 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;@7f2b4c4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:00:24,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:00:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 11:00:24,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:24,444 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:24,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1966256137, now seen corresponding path program 1 times [2024-11-07 11:00:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949234517] [2024-11-07 11:00:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949234517] [2024-11-07 11:00:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949234517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:00:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898354179] [2024-11-07 11:00:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:24,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:00:24,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:24,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:00:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:00:24,938 INFO L87 Difference]: Start difference. First operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:24,960 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2024-11-07 11:00:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:00:24,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-07 11:00:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:24,967 INFO L225 Difference]: With dead ends: 183 [2024-11-07 11:00:24,967 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 11:00:24,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:00:24,975 INFO L432 NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:24,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 11:00:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 11:00:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-07 11:00:25,018 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2024-11-07 11:00:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-07 11:00:25,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-07 11:00:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 11:00:25,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:25,022 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:00:25,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:25,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1580299313, now seen corresponding path program 1 times [2024-11-07 11:00:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716754126] [2024-11-07 11:00:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:25,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716754126] [2024-11-07 11:00:25,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716754126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:25,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:25,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655411992] [2024-11-07 11:00:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:25,361 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:25,402 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-07 11:00:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-11-07 11:00:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:25,408 INFO L225 Difference]: With dead ends: 181 [2024-11-07 11:00:25,408 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 11:00:25,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:25,411 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:25,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 11:00:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 11:00:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-07 11:00:25,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2024-11-07 11:00:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:25,433 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-07 11:00:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-07 11:00:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 11:00:25,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:25,436 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:25,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:00:25,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1378475379, now seen corresponding path program 1 times [2024-11-07 11:00:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133689208] [2024-11-07 11:00:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133689208] [2024-11-07 11:00:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133689208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:25,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938921957] [2024-11-07 11:00:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:25,755 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:25,795 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2024-11-07 11:00:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-11-07 11:00:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:25,799 INFO L225 Difference]: With dead ends: 185 [2024-11-07 11:00:25,799 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 11:00:25,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:25,800 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:25,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:00:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 11:00:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 11:00:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-07 11:00:25,812 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2024-11-07 11:00:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-07 11:00:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-07 11:00:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 11:00:25,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:25,817 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:25,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:00:25,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -85394738, now seen corresponding path program 1 times [2024-11-07 11:00:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391702741] [2024-11-07 11:00:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391702741] [2024-11-07 11:00:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391702741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:00:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526838708] [2024-11-07 11:00:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:00:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:26,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:00:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:00:26,292 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:26,565 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2024-11-07 11:00:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:00:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-11-07 11:00:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:26,568 INFO L225 Difference]: With dead ends: 215 [2024-11-07 11:00:26,571 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 11:00:26,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:00:26,573 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 450 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:00:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 11:00:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2024-11-07 11:00:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-07 11:00:26,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 103 [2024-11-07 11:00:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:26,587 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-07 11:00:26,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-07 11:00:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 11:00:26,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:26,593 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:26,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:00:26,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:26,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1495965032, now seen corresponding path program 1 times [2024-11-07 11:00:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:26,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444441229] [2024-11-07 11:00:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:29,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444441229] [2024-11-07 11:00:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444441229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 11:00:29,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202149897] [2024-11-07 11:00:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:29,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 11:00:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:29,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 11:00:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:00:29,950 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:31,341 INFO L93 Difference]: Finished difference Result 369 states and 521 transitions. [2024-11-07 11:00:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 11:00:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-11-07 11:00:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:31,344 INFO L225 Difference]: With dead ends: 369 [2024-11-07 11:00:31,344 INFO L226 Difference]: Without dead ends: 275 [2024-11-07 11:00:31,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-11-07 11:00:31,347 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 369 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:31,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 797 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 11:00:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-07 11:00:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2024-11-07 11:00:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-11-07 11:00:31,383 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 104 [2024-11-07 11:00:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:31,385 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-11-07 11:00:31,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-11-07 11:00:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 11:00:31,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:31,387 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:31,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:00:31,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:31,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1767514722, now seen corresponding path program 1 times [2024-11-07 11:00:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812791109] [2024-11-07 11:00:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812791109] [2024-11-07 11:00:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812791109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:00:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947760369] [2024-11-07 11:00:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:31,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:00:31,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:00:31,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:00:31,899 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:32,355 INFO L93 Difference]: Finished difference Result 275 states and 395 transitions. [2024-11-07 11:00:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:00:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-07 11:00:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:32,361 INFO L225 Difference]: With dead ends: 275 [2024-11-07 11:00:32,361 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 11:00:32,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:00:32,362 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 465 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:00:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 11:00:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2024-11-07 11:00:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2024-11-07 11:00:32,391 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 105 [2024-11-07 11:00:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2024-11-07 11:00:32,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2024-11-07 11:00:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 11:00:32,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:32,396 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:32,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:00:32,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:32,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash 533307868, now seen corresponding path program 1 times [2024-11-07 11:00:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:32,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490038784] [2024-11-07 11:00:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:32,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490038784] [2024-11-07 11:00:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490038784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:00:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123676933] [2024-11-07 11:00:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:33,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:00:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:33,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:00:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:00:33,862 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:35,032 INFO L93 Difference]: Finished difference Result 405 states and 576 transitions. [2024-11-07 11:00:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 11:00:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-07 11:00:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:35,035 INFO L225 Difference]: With dead ends: 405 [2024-11-07 11:00:35,035 INFO L226 Difference]: Without dead ends: 303 [2024-11-07 11:00:35,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-07 11:00:35,039 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 409 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:35,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 763 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 11:00:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-07 11:00:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-11-07 11:00:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-07 11:00:35,058 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 105 [2024-11-07 11:00:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-07 11:00:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-07 11:00:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 11:00:35,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:35,060 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:35,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:00:35,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1424201366, now seen corresponding path program 1 times [2024-11-07 11:00:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371502647] [2024-11-07 11:00:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:36,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:36,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371502647] [2024-11-07 11:00:36,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371502647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:36,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:36,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:00:36,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481650207] [2024-11-07 11:00:36,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:36,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:00:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:36,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:00:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:00:36,599 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:37,206 INFO L93 Difference]: Finished difference Result 312 states and 446 transitions. [2024-11-07 11:00:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:00:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-07 11:00:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:37,209 INFO L225 Difference]: With dead ends: 312 [2024-11-07 11:00:37,209 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 11:00:37,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-07 11:00:37,210 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 248 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:37,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 467 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:00:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 11:00:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 109. [2024-11-07 11:00:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-07 11:00:37,226 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 105 [2024-11-07 11:00:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:37,227 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-07 11:00:37,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 11:00:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-07 11:00:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 11:00:37,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:37,228 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:00:37,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2079739038, now seen corresponding path program 1 times [2024-11-07 11:00:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:37,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931643017] [2024-11-07 11:00:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931643017] [2024-11-07 11:00:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931643017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:37,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:00:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082227513] [2024-11-07 11:00:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:37,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:00:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:00:37,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:00:37,672 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:38,072 INFO L93 Difference]: Finished difference Result 254 states and 360 transitions. [2024-11-07 11:00:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:00:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 11:00:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:38,076 INFO L225 Difference]: With dead ends: 254 [2024-11-07 11:00:38,076 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 11:00:38,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:00:38,077 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 169 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:38,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 542 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:00:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 11:00:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2024-11-07 11:00:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-07 11:00:38,092 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 106 [2024-11-07 11:00:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:38,092 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-07 11:00:38,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-07 11:00:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 11:00:38,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:38,094 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:00:38,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1630390750, now seen corresponding path program 1 times [2024-11-07 11:00:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:38,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091399195] [2024-11-07 11:00:38,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:38,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091399195] [2024-11-07 11:00:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091399195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:00:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325102854] [2024-11-07 11:00:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:00:38,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:00:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:00:38,866 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:39,467 INFO L93 Difference]: Finished difference Result 435 states and 614 transitions. [2024-11-07 11:00:39,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:00:39,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 11:00:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:39,470 INFO L225 Difference]: With dead ends: 435 [2024-11-07 11:00:39,470 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 11:00:39,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-07 11:00:39,473 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 237 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:39,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 437 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:00:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 11:00:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 198. [2024-11-07 11:00:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3872832369942196) internal successors, (240), 173 states have internal predecessors, (240), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 284 transitions. [2024-11-07 11:00:39,500 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 284 transitions. Word has length 106 [2024-11-07 11:00:39,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:39,501 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 284 transitions. [2024-11-07 11:00:39,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 284 transitions. [2024-11-07 11:00:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 11:00:39,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:39,502 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:39,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:00:39,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:39,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2077770532, now seen corresponding path program 1 times [2024-11-07 11:00:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168828849] [2024-11-07 11:00:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168828849] [2024-11-07 11:00:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168828849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794604538] [2024-11-07 11:00:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:39,650 INFO L87 Difference]: Start difference. First operand 198 states and 284 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:39,759 INFO L93 Difference]: Finished difference Result 319 states and 456 transitions. [2024-11-07 11:00:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 11:00:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:39,761 INFO L225 Difference]: With dead ends: 319 [2024-11-07 11:00:39,761 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 11:00:39,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:39,762 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:39,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:00:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 11:00:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 124. [2024-11-07 11:00:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-11-07 11:00:39,777 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 106 [2024-11-07 11:00:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:39,777 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-11-07 11:00:39,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-11-07 11:00:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 11:00:39,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:39,780 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:39,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:00:39,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1159429650, now seen corresponding path program 1 times [2024-11-07 11:00:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146581845] [2024-11-07 11:00:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146581845] [2024-11-07 11:00:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146581845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 11:00:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864577569] [2024-11-07 11:00:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:00:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:00:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:00:40,334 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:40,982 INFO L93 Difference]: Finished difference Result 417 states and 581 transitions. [2024-11-07 11:00:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:00:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 11:00:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:40,986 INFO L225 Difference]: With dead ends: 417 [2024-11-07 11:00:40,986 INFO L226 Difference]: Without dead ends: 296 [2024-11-07 11:00:40,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 11:00:40,988 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 174 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:40,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 555 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:00:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-07 11:00:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2024-11-07 11:00:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.361963190184049) internal successors, (222), 163 states have internal predecessors, (222), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-11-07 11:00:41,023 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 106 [2024-11-07 11:00:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:41,024 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-11-07 11:00:41,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-11-07 11:00:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 11:00:41,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:41,025 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 11:00:41,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2114469292, now seen corresponding path program 1 times [2024-11-07 11:00:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384224132] [2024-11-07 11:00:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:41,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384224132] [2024-11-07 11:00:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384224132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:41,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:00:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729871567] [2024-11-07 11:00:41,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:41,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:00:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:00:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,182 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:41,290 INFO L93 Difference]: Finished difference Result 301 states and 425 transitions. [2024-11-07 11:00:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:00:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-11-07 11:00:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:41,292 INFO L225 Difference]: With dead ends: 301 [2024-11-07 11:00:41,292 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 11:00:41,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:00:41,293 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:41,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 11:00:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 11:00:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 116. [2024-11-07 11:00:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 11:00:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-11-07 11:00:41,311 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2024-11-07 11:00:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:41,312 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-11-07 11:00:41,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-11-07 11:00:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 11:00:41,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:41,313 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 11:00:41,313 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1327552241, now seen corresponding path program 1 times [2024-11-07 11:00:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:41,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220226280] [2024-11-07 11:00:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-07 11:00:41,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:41,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220226280] [2024-11-07 11:00:41,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220226280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:41,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:41,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 11:00:41,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622773220] [2024-11-07 11:00:41,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:41,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:00:41,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:41,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:00:41,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:00:41,806 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 11:00:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:42,405 INFO L93 Difference]: Finished difference Result 277 states and 386 transitions. [2024-11-07 11:00:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:00:42,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107 [2024-11-07 11:00:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:42,407 INFO L225 Difference]: With dead ends: 277 [2024-11-07 11:00:42,407 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 11:00:42,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-07 11:00:42,408 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:42,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 389 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:00:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 11:00:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2024-11-07 11:00:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 136 states have internal predecessors, (180), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:00:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2024-11-07 11:00:42,428 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 107 [2024-11-07 11:00:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:42,428 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2024-11-07 11:00:42,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-07 11:00:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2024-11-07 11:00:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 11:00:42,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:42,430 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:42,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 11:00:42,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1007866504, now seen corresponding path program 1 times [2024-11-07 11:00:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435529296] [2024-11-07 11:00:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435529296] [2024-11-07 11:00:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435529296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:43,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:00:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136715777] [2024-11-07 11:00:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:43,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:00:43,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:00:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:00:43,039 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:43,425 INFO L93 Difference]: Finished difference Result 309 states and 426 transitions. [2024-11-07 11:00:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:00:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-11-07 11:00:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:43,429 INFO L225 Difference]: With dead ends: 309 [2024-11-07 11:00:43,429 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 11:00:43,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 11:00:43,433 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 161 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:43,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 515 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:00:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 11:00:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2024-11-07 11:00:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.323943661971831) internal successors, (188), 143 states have internal predecessors, (188), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:00:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2024-11-07 11:00:43,458 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 107 [2024-11-07 11:00:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2024-11-07 11:00:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-07 11:00:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 11:00:43,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:43,462 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:43,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 11:00:43,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:43,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1114702325, now seen corresponding path program 1 times [2024-11-07 11:00:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392342681] [2024-11-07 11:00:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-07 11:00:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392342681] [2024-11-07 11:00:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392342681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:00:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734567619] [2024-11-07 11:00:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:00:44,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:00:44,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:00:44,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 11:00:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:44,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 11:00:44,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:00:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:00:46,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:00:46,494 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-07 11:00:46,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-07 11:00:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:00:46,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:00:46,640 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-11-07 11:00:46,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2024-11-07 11:00:46,701 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-07 11:00:46,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2024-11-07 11:00:46,749 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 11:00:46,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-07 11:00:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 11:00:46,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 11:00:55,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734567619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:00:55,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 11:00:55,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-11-07 11:00:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057839823] [2024-11-07 11:00:55,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 11:00:55,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 11:00:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:55,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 11:00:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=730, Unknown=2, NotChecked=0, Total=812 [2024-11-07 11:00:55,201 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-07 11:00:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:58,525 INFO L93 Difference]: Finished difference Result 388 states and 525 transitions. [2024-11-07 11:00:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 11:00:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 108 [2024-11-07 11:00:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:58,527 INFO L225 Difference]: With dead ends: 388 [2024-11-07 11:00:58,527 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 11:00:58,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=660, Invalid=3244, Unknown=2, NotChecked=0, Total=3906 [2024-11-07 11:00:58,529 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 640 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:58,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 789 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 11:00:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 11:00:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 169. [2024-11-07 11:00:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 143 states have internal predecessors, (186), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2024-11-07 11:00:58,563 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 108 [2024-11-07 11:00:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:58,564 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2024-11-07 11:00:58,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.818181818181818) internal successors, (106), 23 states have internal predecessors, (106), 6 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-07 11:00:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2024-11-07 11:00:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 11:00:58,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:58,565 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:58,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 11:00:58,766 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 11:00:58,766 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:58,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1444146565, now seen corresponding path program 1 times [2024-11-07 11:00:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604635509] [2024-11-07 11:00:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:00:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:00:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:00:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:00:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:00:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:00:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 11:00:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:00:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 11:00:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 11:00:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 11:00:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 11:00:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:00:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604635509] [2024-11-07 11:00:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604635509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:00:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:00:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:00:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170336867] [2024-11-07 11:00:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:00:59,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:00:59,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:00:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:00:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:00:59,124 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:00:59,389 INFO L93 Difference]: Finished difference Result 283 states and 388 transitions. [2024-11-07 11:00:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:00:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-11-07 11:00:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:00:59,391 INFO L225 Difference]: With dead ends: 283 [2024-11-07 11:00:59,391 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 11:00:59,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:00:59,392 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 152 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:00:59,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 295 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:00:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 11:00:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-07 11:00:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.295774647887324) internal successors, (184), 143 states have internal predecessors, (184), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 11:00:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions. [2024-11-07 11:00:59,425 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 108 [2024-11-07 11:00:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:00:59,426 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 228 transitions. [2024-11-07 11:00:59,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 11:00:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions. [2024-11-07 11:00:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 11:00:59,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:00:59,427 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:00:59,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 11:00:59,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:00:59,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:00:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -918244416, now seen corresponding path program 1 times [2024-11-07 11:00:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:00:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544989613] [2024-11-07 11:00:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:00:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 11:00:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114285931] [2024-11-07 11:00:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:00:59,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:00:59,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:00:59,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 11:00:59,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 11:00:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:00:59,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-07 11:00:59,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:01:00,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:00,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:01,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:01,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:01,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:01:02,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-07 11:01:02,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:02,413 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-07 11:01:02,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 62 [2024-11-07 11:01:07,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:07,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:01:11,534 INFO L349 Elim1Store]: treesize reduction 972, result has 56.5 percent of original size [2024-11-07 11:01:11,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 3 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 187 case distinctions, treesize of input 202 treesize of output 1364