./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.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-24.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', 'eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd'] 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-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:37,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:37,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:53:37,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:37,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:37,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:37,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:37,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:37,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:37,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:37,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:37,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:37,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:37,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:37,717 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:37,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:37,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:37,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:37,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:53:37,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:37,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:37,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:37,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:37,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:37,720 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-07 10:53:38,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:38,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:38,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:38,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:38,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:38,035 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-24.i [2024-11-07 10:53:39,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:39,587 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:39,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-07 10:53:39,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4306d07a0/28d412b8216c40f5b0f1ac38316e1bf7/FLAG8db08c960 [2024-11-07 10:53:39,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4306d07a0/28d412b8216c40f5b0f1ac38316e1bf7 [2024-11-07 10:53:39,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:39,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:39,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:39,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:39,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:39,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec5391f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39, skipping insertion in model container [2024-11-07 10:53:39,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:39,747 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-24.i[917,930] [2024-11-07 10:53:39,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:39,811 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:39,820 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-24.i[917,930] [2024-11-07 10:53:39,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:39,886 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:39,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39 WrapperNode [2024-11-07 10:53:39,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:39,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:39,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:39,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:39,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,942 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2024-11-07 10:53:39,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:39,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:39,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:39,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:39,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,962 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:53:39,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:39,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:39,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:39,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:39,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:39,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (1/1) ... [2024-11-07 10:53:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:40,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:53:40,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:53:40,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:53:40,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:40,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:40,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:53:40,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:40,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:40,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:40,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:40,778 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:40,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:40,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:40,792 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:40,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:40 BoogieIcfgContainer [2024-11-07 10:53:40,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:40,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:40,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:40,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:40,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:39" (1/3) ... [2024-11-07 10:53:40,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d0a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:40, skipping insertion in model container [2024-11-07 10:53:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:39" (2/3) ... [2024-11-07 10:53:40,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216d0a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:40, skipping insertion in model container [2024-11-07 10:53:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:40" (3/3) ... [2024-11-07 10:53:40,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-07 10:53:40,821 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:40,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:40,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:40,893 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;@501e91c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:40,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:40,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:40,911 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:40,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:40,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2024-11-07 10:53:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653591473] [2024-11-07 10:53:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653591473] [2024-11-07 10:53:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653591473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:41,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319163064] [2024-11-07 10:53:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:41,417 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:41,444 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-07 10:53:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:41,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-07 10:53:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:41,452 INFO L225 Difference]: With dead ends: 195 [2024-11-07 10:53:41,452 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 10:53:41,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:41,459 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:41,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 10:53:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 10:53:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 10:53:41,493 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-07 10:53:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 10:53:41,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 10:53:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:41,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:41,498 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:53:41,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:41,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2024-11-07 10:53:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239708296] [2024-11-07 10:53:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239708296] [2024-11-07 10:53:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239708296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:41,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:41,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077400771] [2024-11-07 10:53:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:41,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:41,941 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:41,996 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-11-07 10:53:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-07 10:53:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:42,001 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:53:42,001 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 10:53:42,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:42,003 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 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 10:53:42,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 10:53:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 10:53:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-07 10:53:42,019 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-07 10:53:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:42,020 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-07 10:53:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-07 10:53:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:42,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:42,026 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:42,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:53:42,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2024-11-07 10:53:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652023399] [2024-11-07 10:53:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652023399] [2024-11-07 10:53:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652023399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:42,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:53:42,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383648008] [2024-11-07 10:53:42,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:42,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:53:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:53:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:53:42,304 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:42,342 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-07 10:53:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:53:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:42,346 INFO L225 Difference]: With dead ends: 196 [2024-11-07 10:53:42,346 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 10:53:42,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:53:42,349 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:42,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 10:53:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 10:53:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-07 10:53:42,367 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2024-11-07 10:53:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:42,368 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-07 10:53:42,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-07 10:53:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:42,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:42,370 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:42,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:53:42,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2024-11-07 10:53:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837689679] [2024-11-07 10:53:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837689679] [2024-11-07 10:53:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837689679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:42,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:53:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435741232] [2024-11-07 10:53:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:42,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:53:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:53:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:53:42,600 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:42,627 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-07 10:53:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:53:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:42,629 INFO L225 Difference]: With dead ends: 198 [2024-11-07 10:53:42,630 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:53:42,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:53:42,632 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:42,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:53:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-07 10:53:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-07 10:53:42,649 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-07 10:53:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:42,650 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-07 10:53:42,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-07 10:53:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:42,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:42,655 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:42,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:53:42,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:42,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:42,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2024-11-07 10:53:42,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:42,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144636408] [2024-11-07 10:53:42,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:42,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144636408] [2024-11-07 10:53:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144636408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:42,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536306321] [2024-11-07 10:53:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:42,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:42,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:42,894 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:42,924 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-07 10:53:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:42,927 INFO L225 Difference]: With dead ends: 202 [2024-11-07 10:53:42,927 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 10:53:42,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:42,928 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:42,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 10:53:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-07 10:53:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-07 10:53:42,936 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-07 10:53:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:42,936 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-07 10:53:42,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-07 10:53:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:42,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:42,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:53:42,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2024-11-07 10:53:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484244823] [2024-11-07 10:53:42,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:43,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:43,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484244823] [2024-11-07 10:53:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484244823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956413622] [2024-11-07 10:53:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:43,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:43,146 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:43,178 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-07 10:53:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:43,181 INFO L225 Difference]: With dead ends: 206 [2024-11-07 10:53:43,182 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:53:43,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:43,183 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:43,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:53:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-07 10:53:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-07 10:53:43,195 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-07 10:53:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-07 10:53:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-07 10:53:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:43,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:43,197 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:43,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:53:43,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:43,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2024-11-07 10:53:43,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:43,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602076856] [2024-11-07 10:53:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602076856] [2024-11-07 10:53:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602076856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:43,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:43,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:53:43,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166621530] [2024-11-07 10:53:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:43,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:43,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:43,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:43,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:43,380 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:43,411 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-07 10:53:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:43,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:43,414 INFO L225 Difference]: With dead ends: 210 [2024-11-07 10:53:43,414 INFO L226 Difference]: Without dead ends: 108 [2024-11-07 10:53:43,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:43,415 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:43,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-07 10:53:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-07 10:53:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-07 10:53:43,424 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-07 10:53:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:43,427 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-07 10:53:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-07 10:53:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:53:43,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:43,429 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:43,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:53:43,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:43,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2024-11-07 10:53:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234698706] [2024-11-07 10:53:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234698706] [2024-11-07 10:53:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234698706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:43,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:43,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:53:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247258946] [2024-11-07 10:53:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:43,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:53:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:53:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:43,990 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:44,302 INFO L93 Difference]: Finished difference Result 263 states and 366 transitions. [2024-11-07 10:53:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:53:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:53:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:44,304 INFO L225 Difference]: With dead ends: 263 [2024-11-07 10:53:44,304 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 10:53:44,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:44,305 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:44,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:53:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 10:53:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2024-11-07 10:53:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-07 10:53:44,320 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2024-11-07 10:53:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-07 10:53:44,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-07 10:53:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:53:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:44,323 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:44,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:53:44,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2024-11-07 10:53:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796124651] [2024-11-07 10:53:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:45,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796124651] [2024-11-07 10:53:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796124651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:45,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326571247] [2024-11-07 10:53:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:45,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:53:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:53:45,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:53:45,110 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:45,819 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2024-11-07 10:53:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:45,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-07 10:53:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:45,821 INFO L225 Difference]: With dead ends: 285 [2024-11-07 10:53:45,821 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 10:53:45,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:45,822 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 164 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:45,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 445 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:53:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 10:53:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2024-11-07 10:53:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-07 10:53:45,845 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2024-11-07 10:53:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-07 10:53:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-07 10:53:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 10:53:45,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:45,847 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:53:45,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2024-11-07 10:53:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464359705] [2024-11-07 10:53:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:46,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464359705] [2024-11-07 10:53:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464359705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488103124] [2024-11-07 10:53:46,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:46,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:46,285 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:46,484 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2024-11-07 10:53:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:53:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-07 10:53:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:46,486 INFO L225 Difference]: With dead ends: 257 [2024-11-07 10:53:46,486 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 10:53:46,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:46,487 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 14 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:46,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 10:53:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-07 10:53:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-07 10:53:46,497 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2024-11-07 10:53:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-07 10:53:46,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-07 10:53:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:53:46,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:46,501 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:53:46,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2024-11-07 10:53:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793123473] [2024-11-07 10:53:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:47,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:47,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793123473] [2024-11-07 10:53:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793123473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:47,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272138123] [2024-11-07 10:53:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:53:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:53:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:53:47,119 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:47,614 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-11-07 10:53:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:53:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-07 10:53:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:47,616 INFO L225 Difference]: With dead ends: 300 [2024-11-07 10:53:47,616 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 10:53:47,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:47,617 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 168 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 323 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:53:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 10:53:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2024-11-07 10:53:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-11-07 10:53:47,631 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2024-11-07 10:53:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-11-07 10:53:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-11-07 10:53:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:53:47,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:47,634 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:47,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:53:47,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:47,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2024-11-07 10:53:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807168482] [2024-11-07 10:53:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807168482] [2024-11-07 10:53:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807168482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:47,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:47,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:47,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470242314] [2024-11-07 10:53:47,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:47,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:47,969 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:48,141 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2024-11-07 10:53:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:53:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-07 10:53:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:48,143 INFO L225 Difference]: With dead ends: 299 [2024-11-07 10:53:48,143 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 10:53:48,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:53:48,144 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:48,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:53:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 10:53:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2024-11-07 10:53:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-07 10:53:48,158 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2024-11-07 10:53:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-07 10:53:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-07 10:53:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:53:48,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:48,159 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:53:48,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -519849880, now seen corresponding path program 1 times [2024-11-07 10:53:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219801674] [2024-11-07 10:53:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219801674] [2024-11-07 10:53:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219801674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:48,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:53:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090150570] [2024-11-07 10:53:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:53:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:48,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:53:48,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:48,946 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:49,481 INFO L93 Difference]: Finished difference Result 310 states and 427 transitions. [2024-11-07 10:53:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:53:49,482 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2024-11-07 10:53:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:49,483 INFO L225 Difference]: With dead ends: 310 [2024-11-07 10:53:49,484 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 10:53:49,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:53:49,485 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 277 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:49,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 418 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:53:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 10:53:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2024-11-07 10:53:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-07 10:53:49,497 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2024-11-07 10:53:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:49,498 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-07 10:53:49,498 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), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:53:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-07 10:53:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:53:49,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:49,501 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:49,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:53:49,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:49,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2024-11-07 10:53:49,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:49,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107108916] [2024-11-07 10:53:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107108916] [2024-11-07 10:53:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107108916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48699061] [2024-11-07 10:53:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:53:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:53:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:53:50,604 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:51,206 INFO L93 Difference]: Finished difference Result 321 states and 442 transitions. [2024-11-07 10:53:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:53:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:51,209 INFO L225 Difference]: With dead ends: 321 [2024-11-07 10:53:51,209 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:53:51,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:53:51,210 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 152 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:51,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 607 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:53:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:53:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2024-11-07 10:53:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-11-07 10:53:51,228 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2024-11-07 10:53:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:51,230 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-11-07 10:53:51,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-11-07 10:53:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:53:51,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:51,232 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:51,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:53:51,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1744775963, now seen corresponding path program 1 times [2024-11-07 10:53:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256213856] [2024-11-07 10:53:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256213856] [2024-11-07 10:53:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256213856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:51,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343663733] [2024-11-07 10:53:51,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:53:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:53:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:53:51,909 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:52,496 INFO L93 Difference]: Finished difference Result 334 states and 459 transitions. [2024-11-07 10:53:52,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:52,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:53:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:52,499 INFO L225 Difference]: With dead ends: 334 [2024-11-07 10:53:52,499 INFO L226 Difference]: Without dead ends: 192 [2024-11-07 10:53:52,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:52,502 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 158 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:52,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 438 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:53:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-07 10:53:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2024-11-07 10:53:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-11-07 10:53:52,519 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2024-11-07 10:53:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:52,519 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-11-07 10:53:52,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-07 10:53:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:53:52,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:52,522 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:53:52,522 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2024-11-07 10:53:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015749300] [2024-11-07 10:53:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:52,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015749300] [2024-11-07 10:53:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015749300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506720623] [2024-11-07 10:53:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:52,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:52,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:52,710 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:52,745 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-07 10:53:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:53:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-07 10:53:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:52,747 INFO L225 Difference]: With dead ends: 294 [2024-11-07 10:53:52,747 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 10:53:52,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:52,748 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:52,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 10:53:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-07 10:53:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-11-07 10:53:52,760 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2024-11-07 10:53:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:52,761 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-11-07 10:53:52,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-11-07 10:53:52,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:53:52,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:52,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:52,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:53:52,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:52,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1305021189, now seen corresponding path program 1 times [2024-11-07 10:53:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:52,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743124302] [2024-11-07 10:53:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743124302] [2024-11-07 10:53:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743124302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:53:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447000178] [2024-11-07 10:53:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:53:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:53:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:53:53,432 INFO L87 Difference]: Start difference. First operand 150 states and 206 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:53,774 INFO L93 Difference]: Finished difference Result 341 states and 465 transitions. [2024-11-07 10:53:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:53:53,775 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-07 10:53:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:53,777 INFO L225 Difference]: With dead ends: 341 [2024-11-07 10:53:53,777 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 10:53:53,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:53,778 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 324 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:53,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 331 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:53:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 10:53:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-07 10:53:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2024-11-07 10:53:53,798 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2024-11-07 10:53:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:53,799 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2024-11-07 10:53:53,799 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2024-11-07 10:53:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:53:53,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:53,800 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:53:53,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 62037240, now seen corresponding path program 1 times [2024-11-07 10:53:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029901575] [2024-11-07 10:53:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:53:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:55,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029901575] [2024-11-07 10:53:55,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029901575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:53:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211461305] [2024-11-07 10:53:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:55,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:53:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:53:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:55,318 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:56,234 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-07 10:53:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:53:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-07 10:53:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:56,236 INFO L225 Difference]: With dead ends: 342 [2024-11-07 10:53:56,236 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 10:53:56,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:53:56,237 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 154 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:56,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 688 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:53:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 10:53:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-11-07 10:53:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:53:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-07 10:53:56,257 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 129 [2024-11-07 10:53:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:56,257 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-07 10:53:56,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:53:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-07 10:53:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:53:56,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:56,259 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:56,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:53:56,260 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2024-11-07 10:53:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180258202] [2024-11-07 10:53:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:53:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:53:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:53:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:53:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:53:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:53:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:53:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:53:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:53:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:53:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:53:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:53:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:53:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 10:53:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180258202] [2024-11-07 10:53:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180258202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:53:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51012035] [2024-11-07 10:53:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:57,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:53:57,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:53:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:57,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:53:57,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:59,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:54:00,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:54:00,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:54:00,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:00,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-07 10:54:01,059 INFO L349 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2024-11-07 10:54:01,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 106 [2024-11-07 10:54:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-07 10:54:01,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:01,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:01,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:01,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:01,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:02,184 INFO L349 Elim1Store]: treesize reduction 1348, result has 11.6 percent of original size [2024-11-07 10:54:02,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 14 new quantified variables, introduced 54 case distinctions, treesize of input 252 treesize of output 810 [2024-11-07 10:54:06,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,664 INFO L349 Elim1Store]: treesize reduction 235, result has 13.6 percent of original size [2024-11-07 10:54:06,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 116 treesize of output 247 [2024-11-07 10:54:06,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:06,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,152 INFO L349 Elim1Store]: treesize reduction 235, result has 13.6 percent of original size [2024-11-07 10:54:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 116 treesize of output 247 [2024-11-07 10:54:07,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:07,719 INFO L349 Elim1Store]: treesize reduction 235, result has 13.6 percent of original size [2024-11-07 10:54:07,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 116 treesize of output 247 [2024-11-07 10:54:08,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:08,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:08,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:08,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:08,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 10:54:08,409 INFO L349 Elim1Store]: treesize reduction 235, result has 13.6 percent of original size [2024-11-07 10:54:08,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 116 treesize of output 247